Results 1 to 10 of about 53 (53)
A survey on matheuristics for routing problems
EURO Journal on Computational Optimization, 2014 In this paper, we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework.
Claudia Archetti, M.Grazia Speranza
doaj +1 more source
Robust flows with adaptive mitigation
EURO Journal on Computational Optimization, 2021 We consider an adjustable robust optimization problem arising in the area of supply chains: given sets of suppliers and demand nodes, we wish to find a flow that is robust with respect to failures of the suppliers.
Heiner Ackermann +2 more
doaj +1 more source
An exploratory computational analysis of dual degeneracy in mixed-integer programming
EURO Journal on Computational Optimization, 2020 Dual degeneracy, i.e., the presence of multiple optimal bases to a linear programming (LP) problem, heavily affects the solution process of mixed integer programming (MIP) solvers. Different optimal bases lead to different cuts being generated, different
Gerald Gamrath +2 more
doaj +1 more source
EURO Journal on Computational Optimization, 2018 In this paper, we present a state-of-the-art branch-and-cut (B&C) algorithm for the multicommodity capacitated fixed charge network design problem (MCND).
Mervat Chouman +2 more
doaj +1 more source
EURO Journal on Computational Optimization, 2020 We consider a model of two parties’ competition organized as a Stackelberg game. The parties open their facilities intending to maximize profit from serving the customers that behave following a binary rule.
Vladimir Beresnev, Andrey Melnikov
doaj +1 more source
Solution methodologies for debris removal in disaster response
EURO Journal on Computational Optimization, 2016 During the disaster response phase of the emergency relief, the aim is to reduce loss of human life by reaching disaster affected areas with relief items as soon as possible. Debris caused by the disaster blocks the roads and prevents emergency aid teams
Nihal Berktaş +2 more
doaj +1 more source
Restrict-and-relax search for 0-1 mixed-integer programs
EURO Journal on Computational Optimization, 2013 A highly desirable characteristic of methods for solving 0-1 mixed-integer programs is that they should be capable of producing high-quality solutions quickly.
Menal Guzelsoy +2 more
doaj +1 more source
Reflections on generating (disjunctive) cuts
EURO Journal on Computational Optimization, 2013 We consider the problem of constructing generic supporting hyperplanes to be used within a (branch and) bound-and-cut algorithm. We review some of the properties that these hyperplanes should enjoy.
Florent Cadoux, Claude Lemaréchal
doaj +1 more source
The complete vertex p-center problem
EURO Journal on Computational Optimization, 2020 The vertex p-center problem consists of locating p facilities among a set of M potential sites such that the maximum distance from any demand to its closest located facility is minimized.
F.Antonio Medrano
doaj +1 more source
Intersection cuts from multiple rows: a disjunctive programming approach
EURO Journal on Computational Optimization, 2013 We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming.
Egon Balas, Andrea Qualizza
doaj +1 more source