Results 31 to 40 of about 138 (67)
Border bases and order ideals: a polyhedral characterization
, 2015 Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border basis correspond
Braun, Gábor, Pokutta, Sebastian
core +1 more source
Rounding-based heuristics for nonconvex MINLPs [PDF]
, 2016 We propose two primal heuristics for nonconvex mixed-integer nonlinear programs. Both are based on the idea of rounding the solution of a continuous nonlinear program subject to linear constraints.
Belotti, Pietro, Nannicini, Giacomo
core +1 more source
VNS-BASED ALGORITHMS FOR THE CENTROID-BASED CLUSTERING PROBLEM [PDF]
, 2019 The k-means algorithm with the corresponding problem formulation is one of the first methods that researchers use when solving a new automatic grouping (clus-tering) problem. Its improvement, modification and combination with other algorithms are described
Kazakovtsev, Lev A. +2 more
core +1 more source
On positivity of Ehrhart polynomials
, 2018 Ehrhart discovered that the function that counts the number of lattice points in dilations of an integral polytope is a polynomial. We call the coefficients of this polynomial Ehrhart coefficients, and say a polytope is Ehrhart positive if all Ehrhart ...
Alexander Postnikov +48 more
core +1 more source
Mathematical Optimization for the Train Timetabling Problem [PDF]
, 2010 AMS Subj. Classification: 90C57; 90C10;Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has
Bojović, Nebojša +4 more
core
A fast and efficient method for solving the multiple line detection problem [PDF]
, 2019 In this paper, we consider the multiple line detection problem on the basis of a data points set coming from a number of lines not known in advance. A new and efficient method is proposed, which is based upon center-based clustering, and it solves this ...
Kristian Sabo +2 more
core +2 more sources
A polyhedral approach to computing border bases [PDF]
, 2010 Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced Gr\"obner bases.
Braun, Gábor, Pokutta, Sebastian
core
D.C. Optimization methods for minimum maximal flow problem [PDF]
, 2004 This paper is concerned with the minimum maximal flow problem, i.e., a problem of minimizing the flow value attained by a maximal flow for agiven network.
Yamamoto Yoshitsugu +2 more
core
Complexity of linear relaxations in integer programming. [PDF]
Math Program, 2022 Averkov G, Schymura M.
europepmc +1 more source
Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems [PDF]
, 2018 We consider the problem of optimizing a novel acoustic leakage detection system for urban water distribution networks. The system is composed of a number of detectors and transponders to be placed in a choice of hydrants such as to provide a desired ...
DeNegre, Scott +2 more
core