Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem

DOI10.1007/S10479-016-2112-9MaRDI QIDQ1686525zbMATH OpenOpenAlexFDO

Authors Francisco Trespalacios, Ignacio E. Grossmann

Publication date 15 December 2017

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-016-2112-9

zbMATH Keywords

strip packingmixed integer programmingdisjunctive programming

Mathematics Subject Classification ID

Linear programming (90C05) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• A hierarchy of relaxations for linear generalized disjunctive programming
• Strip based compact formulation for two-dimensional guillotine cutting problems
• On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
• Symmetry-breaking constraints for packing identical rectangles within polyhedra
• An optimization model for the strip-packing problem and its augmented Lagrangian method

Cites work

• A branch and bound algorithm for the strip packing problem
• An exact approach to the strip-packing problem
• An improved typology of cutting and packing problems
• Disjunctive Programming
• Generalized convex disjunctive programming: Nonlinear convex hull relaxation
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Scheduling inspired models for two-dimensional packing problems
• Symmetry in integer linear programming
• Two-dimensional packing problems: a survey

Cited in

(1)

• Simultaneous optimization of production planning and inventory management of polyurethane foam plant

Describes a project that uses

Uses Software

• Gurobi
• GAMS

This page was built for publication: Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686525)