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

DOI10.1007/S10479-016-2112-9zbMATH Open1381.90022OpenAlexW2277512636MaRDI QIDQ1686525FDOQ1686525

Ignacio E. Grossmann, Francisco Trespalacios

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

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

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)

Cites Work

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

Cited In (1)

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

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)