A 4/3-APPROXIMATION ALGORITHM FOR CASSETTE PACKING IN STEEL INDUSTRY

DOI10.1142/S0217595907001462zbMath1160.90635OpenAlexW2127356252MaRDI QIDQ3503009

Hark-Chin Hwang

Publication date: 20 May 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595907001462

zbMATH Keywords

NP-completetwo-dimensional vector packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• There is no asymptotic PTAS for two-dimensional vector packing
• Bin packing can be solved within 1+epsilon in linear time
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
• A two-dimensional vector packing model for the efficient use of coil cassettes
• New Algorithms for Bin Packing

This page was built for publication: A 4/3-APPROXIMATION ALGORITHM FOR CASSETTE PACKING IN STEEL INDUSTRY