Strip Packing vs. Bin Packing

DOI10.1007/978-3-540-72870-2_34zbMath1137.90648arXivcs/0607046OpenAlexW1540493477MaRDI QIDQ5434454

Deshi Ye, Xin Han, Guo-Chuan Zhang, Kazuo Iwama

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0607046

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial optimization (90C27)

Related Items (8)

A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ Unnamed Item ⋮ On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis ⋮ Online square packing with gravity ⋮ A new upper bound for the online square packing problem in a strip ⋮ A note on online strip packing ⋮ Improved lower bound for online strip packing ⋮ On capacitated covering with unit balls

This page was built for publication: Strip Packing vs. Bin Packing