An exploratory computational analysis of dual degeneracy in mixed-integer programming
Year of publication: |
2020
|
---|---|
Authors: | Gamrath, Gerald ; Berthold, Timo ; Salvagnin, Domenico |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 8.2020, 3, p. 241-261
|
Subject: | Mixed integer programming | Dual degeneracy | Linear programming | Branch-and-bound | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
Improved branching disjunctions for branch-and-bound : an analytic center approach
Elhedi, Samir, (2015)
-
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof, (2022)
-
On the design of R-based scalable frameworks for data science applications
Theußl, Stefan Peter, (2020)
- More ...
-
Ten years of feasibility pump, and counting
Berthold, Timo, (2019)
-
Improving strong branching by domain propagation
Gamrath, Gerald, (2014)
-
Heuristics of the branch-cut-and-price-framework SCIP
Berthold, Timo, (2008)
- More ...