High multiplicity strip packing with three rectangle types

DOI10.1007/978-3-031-18530-4_16zbMath1528.90204OpenAlexW4312584773MaRDI QIDQ6111509

Andy Jinqing Yu, Roberto Solis-Oba, Andrew Bloch-Hansen

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-18530-4_16

zbMATH Keywords

approximation algorithmhigh multiplicityLP-relaxationtwo-dimensional strip packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• A \((5/3+\varepsilon)\)-approximation for strip packing
• Rectangle packing with one-dimensional resource augmentation
• A 2.5 times optimal algorithm for packing in two dimensions
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• Unnamed Item
• Unnamed Item

This page was built for publication: High multiplicity strip packing with three rectangle types