Results 11 to 20 of about 138 (67)
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
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
Symmetric, Hankel-symmetric, and Centrosymmetric Doubly Stochastic Matrices [PDF]
, 2017 We investigate convex polytopes of doubly stochastic matrices having special structures: symmetric, Hankel symmetric, centrosymmetric, and both symmetric and Hankel symmetric.
Brualdi, Richard R., Cao, Lei
core +3 more sources
Vertex adjacencies in the set covering polyhedron [PDF]
, 2017 We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope.
Aguilera, Néstor E. +2 more
core +2 more sources
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
Total Dual Integrality in Some Facility Location Problems [PDF]
, 2012 published_or_final_versio
Chen, X, Chen, Z, Zang, W
core +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
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
, 2011 We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse PSD cuts, and principal minors PSD ...
Belotti, Pietro +2 more
core +2 more sources