Solution methods for the tray optimization problem
From MaRDI portal
Publication:1653393
DOI10.1016/j.ejor.2018.05.051zbMath1403.90014OpenAlexW2806150322WikidataQ129734926 ScholiaQ129734926MaRDI QIDQ1653393
Twan Dollevoet, Kristiaan M. Glorie, J. Theresia van Essen
Publication date: 3 August 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://resolver.tudelft.nl/uuid:7a032660-dd7f-442c-8f64-b9e8768d7de0
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- A note on ``A LP-based heuristic for a time-constrained routing problem
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- Improving Discrete Model Representations via Symmetry Considerations
- Hospital Waiting List Management Models
- Reducibility among Combinatorial Problems
This page was built for publication: Solution methods for the tray optimization problem