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...
Saved in:
Main Authors: | Gerald Gamrath, Timo Berthold, Domenico Salvagnin |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2020
|
Subjects: | |
Online Access: | https://doaj.org/article/02acf5f02ecf4593a8b6c0599764c3ca |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Ten years of feasibility pump, and counting
by: Timo Berthold, et al.
Published: (2019) -
Improving strong branching by domain propagation
by: Gerald Gamrath
Published: (2014) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
by: C. Gentile, et al.
Published: (2017) -
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
by: Patrick Gemander, et al.
Published: (2020) -
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
by: FalkM. Hante, et al.
Published: (2019)