LP bounds in various constraint programming approaches for orthogonal packing
Year of publication: |
2012
|
---|---|
Authors: | Mesyagutov, Marat ; Scheithauer, Guntram ; Belov, Gleb |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 10, p. 2425-2438
|
Subject: | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | USA | United States | Theorie | Theory | Packproblem | Packing problem |
-
A parallel branch-and-bound approach to the rectangular guillotine strip cutting Problem
Bak, Slawomir, (2011)
-
A branch & bound algorithm for cutting and packing irregularly shaped pieces
Alvarez-Valdes, Ramon, (2013)
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
- More ...
-
One-dimensional relaxations and LP bounds for orthogonal packing
Belov, Gleb, (2009)
-
Conservative scales in packing problems
Belov, Gleb, (2013)
-
LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
Belov, Gleb, (2013)
- More ...