A two-dimensional vector packing model for the efficient use of coil cassettes
From MaRDI portal
(Redirected from Publication:2387252)
Recommendations
Cites work
- 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
- Bin packing can be solved within 1+epsilon in linear time
- scientific article; zbMATH DE number 1305407 (Why is no real title available?)
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- New Algorithms for Bin Packing
- Resource constrained scheduling as generalized bin packing
- There is no asymptotic PTAS for two-dimensional vector packing
Cited in
(7)- A branch-and-price algorithm for the two-dimensional vector packing problem
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
- 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
- A 4/3-APPROXIMATION ALGORITHM FOR CASSETTE PACKING IN STEEL INDUSTRY
- A new two-dimensional interleaving technique using successive packing
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
This page was built for publication: A two-dimensional vector packing model for the efficient use of coil cassettes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387252)