A two-dimensional vector packing model for the efficient use of coil cassettes
From MaRDI portal
Publication:2387252
DOI10.1016/j.cor.2004.01.006zbMath1068.90091OpenAlexW2054018447MaRDI QIDQ2387252
Soo Y. Chang, Sanghyuck Park, Hark-Chin Hwang
Publication date: 2 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.01.006
Related Items
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem ⋮ Vector bin packing with heterogeneous bins: application to the machine reassignment problem ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ A 4/3-APPROXIMATION ALGORITHM FOR CASSETTE PACKING IN STEEL INDUSTRY ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem
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
- Resource constrained scheduling as generalized bin packing
- 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
- New Algorithms for Bin Packing
- Lower bounds and algorithms for the 2-dimensional vector packing problem
