Results 1 to 10 of about 502 (85)
RAIRO Oper. Res., 2021 This paper considers an exact bi-objective approach for simultaneously minimizing the total cost of flow routing and the network bottleneck when link qualities and flow weights are relevant.
L. Pinto +2 more
semanticscholar +1 more source
High accuracy semidefinite programming bounds for kissing numbers [PDF]
, 2009 The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere.
Mittelmann, Hans D., Vallentin, Frank
core +7 more sources
The response of hot wires in high Reynolds-number turbulent pipe flow [PDF]
, 2004 Issues concerning the accuracy of hot-wire measurements in turbulent pipe flow are addressed for pipe Reynolds numbers up to 6 × 106 and hot-wire Reynolds numbers up to Rew ap 250. These include the optimization of spatial and temporal resolution and the
Jiang, W. +4 more
core +1 more source
Empirical study of the greedy heuristic as applied to the link selection problem
Acta Universitatis Sapientiae: Informatica, 2015 Behind the link selection problem there is a practical problem that aims to check efficiently the vehicles on a road network. The checking process is to be realized with license plate reading cameras for checking the valid vignette of vehicles using that
Pusztai Pál, Hajba Tamás
doaj +1 more source
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II
, 2014 : This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions.
A. Eremeev, Julia V. Kovalenko
semanticscholar +1 more source
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations [PDF]
, 2015 We propose two exact approaches for non-convex quadratic integer minimization subject to linear constraints where lower bounds are computed by considering ellipsoidal relaxations of the feasible set.
Buchheim, Christoph +2 more
core +1 more source
AN ANNOTATED BIBLIOGRAPHY OF COMBINED ROUTING AND LOADING PROBLEMS
, 2013 : Transportation problems involving routing and loading at the same time are currently a hot topic in combinatorial optimization. The interest of researchers and practitioners is motivated by the intrinsic difficulty of this research area, which combines
M. Iori, S. Martello
semanticscholar +1 more source
Tropical determinant on transportation polytope [PDF]
, 2014 Let ${\mathcal D}^{k,l}(m,n)$ be the set of all the integer points in the transportation polytope of $kn\times ln$ matrices with row sums $lm$ and column sums $km$.
Gajula, Sailaja +2 more
core +3 more sources
The distributions of functions related to parametric integer optimization [PDF]
, 2020 We consider the asymptotic distribution of the IP sparsity function, which measures the minimal support of optimal IP solutions, and the IP to LP distance function, which measures the distance between optimal IP and LP solutions.
Oertel, Timm +2 more
core +3 more sources
On finitely generated closures in the theory of cutting planes [PDF]
, 2012 Let $P$ be a rational polyhedron in $\mathbb{R}^d$ and let $\mathcal{L}$ be a class of $d$-dimensional maximal lattice-free rational polyhedra in $\mathbb{R}^d$. For $L \in \mathcal{L}$ by $R_L(P)$ we denote the convex hull of points belonging to $P$ but
Averkov, Gennadiy
core +2 more sources