Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
Year of publication: |
November 2017
|
---|---|
Authors: | Trespalacios, Francisco ; Grossmann, Ignacio E. |
Published in: |
Annals of operations research ; volume 258, number 2 (November 2017). - New York, NY, USA : Springer. - 2017, p. 747-759
|
Subject: | Packproblem | Packing problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Extracting maximal objects from three-dimensional solid materials
Silva, Everton Fernandes, (2021)
-
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Martinovic, John, (2021)
-
An improved configuration checking-based algorithm for the unicost set covering problem
Wang, Yiyuan, (2021)
- More ...
-
Cutting plane algorithm for convex generalized disjunctive programs
Trespalacios, Francisco, (2016)
-
Trespalacios, Francisco, (2015)
-
Trespalacios, Francisco, (2016)
- More ...