Results 11 to 20 of about 118 (48)
EURO Journal on Computational Optimization, 2017 The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods.
Thais Ávila +3 more
doaj +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
GENETIC ALGORITHM WITH GREEDY CROSSOVER AND ELITISM FOR CAPACITY PLANNING [PDF]
, 2022 We propose a modification to the genetic algorithm with greedy agglomerative crossover operator for the problem of scheduling product types at the facilities of the metal or plastic production factory where the goal is to minimize the number of ...
Kazakovtsev, Lev +3 more
core +1 more source
A branch-and-cut algorithm for the target visitation problem
EURO Journal on Computational Optimization, 2019 In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
doaj +1 more source
Polygons as Sections of Higher-Dimensional Polytopes [PDF]
, 2015 We show that every heptagon is a section of a 3-polytope with 6 vertices. This implies that every n-gon with n≥7 can be obtained as a section of a (2+⌊n7⌋)-dimensional polytope with at most ⌈6n7⌉ vertices; and provides a geometric proof of the fact that ...
Padrol, Arnau, Pfeifle, Julian
core +3 more sources
A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem [PDF]
, 2016 This paper presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known.
Dalmeijer, K. (Kevin), Spliet, R. (Remy)
core +5 more sources
Total Dual Integrality in Some Facility Location Problems [PDF]
, 2012 published_or_final_versio
Chen, X, Chen, Z, Zang, W
core +1 more source
COMPARATIVE STUDY OF MUTATION OPERATORS IN THE GENETIC ALGORITHMS FOR THE K-MEANS PROBLEM [PDF]
, 2021 The k-means problem and the algorithm of the same name are the most commonly used clustering model and algorithm. Being a local search optimization method, the k-means algorithm falls to a local minimum of the objective function (sum of squared errors ...
Kazakovtsev, Lev A., Li, Rui
core +1 more source
A min-max theorem on tournaments [PDF]
, 2007 We present a structural characterization of all tournaments T = (V, A) such that, for any nonnegative integral weight function defined on V, the maximum size of a feedback vertex set packing is equal to the minimum weight of a triangle in T.
Chen, X, Hu, X, Zang, W
core +1 more source
Integer Polynomial Optimization in Fixed Dimension
, 2004 We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed.
Barvinok A. I. +9 more
core +4 more sources