Column (and row) generation algorithms for the pallet loading problem
From MaRDI portal
Cites work
- A branch-and-cut algorithm for the pallet loading problem
- A family of genetic algorithms for the pallet loading problem
- A fast algorithm for two-dimensional pallet loading problems of large size
- A note on an L-approach for solving the manufacturer's pallet loading problem
- A note on branch-and-cut-and-price
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- A tabu search algorithm for the pallet loading problem
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- An Algorithm for Two-Dimensional Cutting Problems
- An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
- An exact algorithm for the pallet loading problem
- An exact depth-first algorithm for the pallet loading problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- Solving the pallet loading problem
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- The G4-Heuristic for the Pallet Loading Problem
- The pallet loading problem: a review of solution methods and computational experiments
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem
- The stable set problem: clique and nodal inequalities revisited
This page was built for publication: Column (and row) generation algorithms for the pallet loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310968)