New inequalities for 1D relaxations of the 2D rectangular strip packing problem

DOI10.1007/978-3-319-28697-6_22zbMATH Open1347.90071OpenAlexW2469665596MaRDI QIDQ2806912FDOQ2806912

Authors: Isabel Friedow, Guntram Scheithauer 

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_22

Recommendations

• Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem
• An exact approach to the strip-packing problem
• Two-dimensional packing problems: a survey
• One-dimensional relaxations and LP bounds for orthogonal packing
• scientific article; zbMATH DE number 1336411

zbMATH Keywords

horizontal one-dimensional bar relaxationone-dimensional cutting patternsvertical contiguous condition

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Two-dimensional packing problems: a survey
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• Reactive GRASP for the strip-packing problem

Cited In (1)

• One-dimensional relaxations and LP bounds for orthogonal packing

This page was built for publication: New inequalities for 1D relaxations of the 2D rectangular strip packing problem

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