Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
From MaRDI portal
Publication:875414
DOI10.1016/j.cor.2005.10.008zbMath1141.90514OpenAlexW2081509772MaRDI QIDQ875414
Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena
Publication date: 13 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.10.008
Related Items (8)
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem ⋮ A decomposition heuristic for the maximal covering location problem ⋮ Column generation approach for the point-feature cartographic label placement problem ⋮ A column generation approach for the unconstrained binary quadratic programming problem ⋮ A branch and price algorithm for single-machine completion time variance ⋮ Computing stable loads for pallets ⋮ The pallet loading problem: a review of solution methods and computational experiments ⋮ A decomposition approach for the probabilistic maximal covering location-allocation problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for coloring Meyniel graphs
- Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
- An exact depth-first algorithm for the pallet loading problem
- A fast algorithm for the maximum clique problem
- A tabu search algorithm for the pallet loading problem
- A branch-and-cut algorithm for the pallet loading problem
- Lagrangean/surrogate relaxation for generalized assignment problems
- An exact algorithm for the pallet loading problem
- A typology of cutting and packing problems
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Solving the maximum clique problem using a tabu search approach
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- A note on an L-approach for solving the manufacturer's pallet loading problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Algorithm for Two-Dimensional Cutting Problems
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- The G4-Heuristic for the Pallet Loading Problem
- The traveling-salesman problem and minimum spanning trees: Part II
- Algorithm 457: finding all cliques of an undirected graph
- A branch-and-price approach for the maximum weight independent set problem
- Analysis of upper bounds for the pallet loading problem
- A fast algorithm for two-dimensional pallet loading problems of large size
This page was built for publication: Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
