Two dimensional knapsack with unloading constraints
From MaRDI portal
Publication:2840720
Recommendations
- A note on a two dimensional knapsack problem with unloading constraints
- Two dimensional strip packing with unloading constraints
- Two-dimensional strip packing with unloading constraints
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Heuristics for the strip packing problem with unloading constraints
Cites work
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- On rectangle packing, maximizing benefits
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
Cited in
(8)- An open space based heuristic for the 2D strip packing problem with unloading constraints
- scientific article; zbMATH DE number 444958 (Why is no real title available?)
- A note on a two dimensional knapsack problem with unloading constraints
- Queue-constrained packing: a vehicle ferry case study
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- Two dimensional strip packing with unloading constraints
- Heuristics for the strip packing problem with unloading constraints
- Two-dimensional strip packing with unloading constraints
This page was built for publication: Two dimensional knapsack with unloading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840720)