One-dimensional relaxations and LP bounds for orthogonal packing
Year of publication: |
2009
|
---|---|
Authors: | Belov, Gleb ; Kartak, Vadin ; Rohling, Heide ; Scheithauer, Guntram |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 16.2009, 6, p. 745-766
|
Subject: | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory | Packproblem | Packing problem |
-
Pivot-and-reduce cuts : an approach for improving Gomory mixed-integer cuts
Wesselmann, Franz, (2011)
-
A prototype column generation strategy for the multiple container loading problem
Zhu, Wenbin, (2012)
-
Gil, Alejandro Fernández, (2023)
- More ...
-
LP bounds in various constraint programming approaches for orthogonal packing
Mesyagutov, Marat, (2012)
-
Conservative scales in packing problems
Belov, Gleb, (2013)
-
LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
Belov, Gleb, (2013)
- More ...