Restrict-and-relax search for 0-1 mixed-integer programs
Year of publication: |
2013
|
---|---|
Authors: | Guzelsoy, Menal ; Nemhauser, George L. ; Savelsbergh, Martin W. P. |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 1.2013, 1/2, p. 201-218
|
Subject: | 0-1 Integer programming | Branch-and-bound | Feasible solutions | Restrict-and-relax | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
A 0-1 integer programming model and solving strategies for the slab storage problem
Lu, Chao, (2016)
-
A scalable dynamic parking allocation framework
Mladenović, Marko, (2021)
-
Branch-and-bound for bi-objective integer programming
Parragh, Sophie N., (2019)
- More ...
-
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
Miller, Andrew J., (2000)
-
Conflict graphs in solving integer programming problems
Atamturk, Alper, (2000)
-
Solving multi-item capacitated lot-sizing problems with setup times by branch-and-cut
Miller, Andrew J., (2000)
- More ...