Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
From MaRDI portal
Publication:5387397
DOI10.1057/PALGRAVE.JORS.2602367zbMATH Open1153.90328OpenAlexW2085147054MaRDI QIDQ5387397FDOQ5387397
Authors: Glaydston M. Ribeiro, Luiz Antonio Nogueira Lorena
Publication date: 9 May 2008
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602367
Recommendations
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- scientific article; zbMATH DE number 2159166
- A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
- The terminal-oriented ship stowage planning problem
- scientific article; zbMATH DE number 2144389
Cited In (6)
- A branch and price algorithm for single-machine completion time variance
- A decomposition heuristic for the maximal covering location problem
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- The pallet loading problem: a review of solution methods and computational experiments
- A decomposition approach for the probabilistic maximal covering location-allocation problem
- Column generation approach for the point-feature cartographic label placement problem
This page was built for publication: Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387397)