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: | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory | Packproblem | Packing problem |
-
The one-dimensional cutting stock problem with usable leftover : a heuristic approach
Cherri, Adriana Cristina, (2009)
-
Online primal-dual algorithms for covering and packing
Buchbinder, Niv, (2009)
-
Heuristics for the variable sized bin-packing problem
Haouari, Mohamed, (2009)
- More ...
-
Cutting plane algorithm for convex generalized disjunctive programs
Trespalacios, Francisco, (2016)
-
Trespalacios, Francisco, (2016)
-
Trespalacios, Francisco, (2015)
- More ...