Lower bounds for three-dimensional multiple-bin-size bin packing problems
DOI10.1007/S00291-013-0347-2zbMATH Open1308.90004OpenAlexW2011818326MaRDI QIDQ2260892FDOQ2260892
Francisco Parreño, José Manuel Tamarit, Ramón Alvarez-Valdes
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) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- An improved typology of cutting and packing problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- New bounds for multidimensional packing
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- The two-dimensional bin packing problem with variable bin sizes and costs
- Exact solution of the two-dimensional finite bin packing problem
- An exact approach to the strip-packing problem
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- Two-Dimensional Finite Bin-Packing Algorithms
- The Three-Dimensional Bin Packing Problem
- New classes of fast lower bounds for bin 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
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- An analytical model for the container loading problem
- Solving the variable size bin packing problem with discretized formulations
- Three-dimensional bin packing problem with variable bin height
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- A general purpose algorithm for three-dimensional packing
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Variable Sized Bin Packing
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- Algorithms – ESA 2004
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
Cited In (1)
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes 👍 👎
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms 👍 👎
- Lower bounds and reduction procedures for the bin packing problem 👍 👎
- New lower bounds for the three-dimensional finite bin packing problem 👍 👎
- Lower bound for 3-batched bin packing 👍 👎
- Inequalities for bin packing-III 👍 👎
- A linear programming approach for the three-dimensional bin-packing problem 👍 👎
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity 👍 👎
- New lower bounds for the three-dimensional orthogonal bin packing problem 👍 👎
This page was built for publication: Lower bounds for three-dimensional multiple-bin-size bin packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260892)
