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

DOI10.1007/s10479-016-2112-9zbMath1381.90022OpenAlexW2277512636MaRDI QIDQ1686525

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

zbMATH Keywords

mixed integer programmingdisjunctive programmingstrip packing

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• Gurobi
• GAMS

Cites Work

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

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