Lower bounds for three-dimensional multiple-bin-size bin packing problems
From MaRDI portal
Publication:2260892
DOI10.1007/s00291-013-0347-2zbMath1308.90004OpenAlexW2011818326MaRDI QIDQ2260892
Francisco Parreño, José Manuel Tamarit, Ramón Alvarez-Valdés
Publication date: 12 March 2015
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-013-0347-2
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)
Related Items
Uses Software
Cites Work
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Three-dimensional bin packing problem with variable bin height
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- An analytical model for the container loading problem
- New bounds for multidimensional packing
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- Solving the variable size bin packing problem with discretized formulations
- The two-dimensional bin packing problem with variable bin sizes and costs
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- A General Purpose Algorithm for Three-Dimensional Packing
- A Linear Programming Approach to the Cutting-Stock Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Variable Sized Bin Packing
- Two-Dimensional Finite Bin-Packing Algorithms
- The Three-Dimensional Bin Packing Problem
- Multistage Cutting Stock Problems of Two and More Dimensions
- Algorithms – ESA 2004
- New classes of fast lower bounds for bin packing problems
