An exploratory computational analysis of dual degeneracy in mixed-integer programming
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 branching decisions being taken and different...
Main Authors: | Gerald Gamrath, Timo Berthold, Domenico Salvagnin |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2020-10-01
|
Series: | EURO Journal on Computational Optimization |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2192440621001295 |
Similar Items
-
Ten years of feasibility pump, and counting
by: Timo Berthold, et al.
Published: (2019-03-01) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
by: C. Gentile, et al.
Published: (2017-03-01) -
Formulations and algorithms for the recoverable Γ-robust knapsack problem
by: Christina Büsing, et al.
Published: (2019-03-01) -
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
by: Patrick Gemander, et al.
Published: (2020-10-01) -
Intersection cuts from multiple rows: a disjunctive programming approach
by: Egon Balas, et al.
Published: (2013-05-01)