Two Dimensional Strip Packing with Unloading Constraints

DOI10.1016/j.endm.2011.05.018zbMath1268.68171OpenAlexW1980445548MaRDI QIDQ2840691

Eduardo Candido Xavier, Flávio K. Miyazawa, Jefferson L. M. da Silveira

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.018

zbMATH Keywords

approximation algorithmsstrip packing problemunloading/loading constraints

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints

Cites Work

• Online Square Packing
• On Two Dimensional Packing
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• On packing of squares and cubes

This page was built for publication: Two Dimensional Strip Packing with Unloading Constraints