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
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
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
A unified matheuristic for solving multi-constrained traveling salesman problems with profits
EURO Journal on Computational Optimization, 2017 In this paper, we address a rich Traveling Salesman Problem with Profits encountered in several real-life cases. We propose a unified solution approach based on variable neighborhood search.
Rahma Lahyani +2 more
doaj +1 more source
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
EURO Journal on Computational Optimization, 2020 In state-of-the-art mixed-integer programming solvers, a large array of reduction techniques are applied to simplify the problem and strengthen the model formulation before starting the actual branch-and-cut phase.
Patrick Gemander +5 more
doaj +1 more source
Influence of Embankments with Parapets on the Cross-Wind Turbulence Intensity at the Contact Wire of Railway Overheads [PDF]
, 2010 Winds as an environmental factor can cause significant difficulties for the railway system operation. The railway overhead has been particularly vulnerable to cross-winds related problems, such as development of undamped oscillations due to galloping ...
Avila Sanchez, Sergio +2 more
core +2 more sources
Improved integral simplex using decomposition for the set partitioning problem
EURO Journal on Computational Optimization, 2018 Integral simplex using decomposition (ISUD) is a method that efficiently solves set partitioning problems. It is an iterative method that starts from a known integer solution and moves through a sequence of integer solutions, decreasing the cost at each ...
Abdelouahab Zaghrouti +2 more
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
Nash equilibria sets in mixed extension of 2x2x2 games [PDF]
Computer Science Journal of Moldova, 2005 We describe the Nash equilibria set as an intersection of graphs of players' best responses. The problem of Nash equilibria set construction for three-person extended 2 2 2 games is studied.
Valeriu Ungureanu, Ana Botnari
doaj