A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
From MaRDI portal
Recommendations
- The Three-Dimensional Bin Packing Problem
- A linear programming approach for the three-dimensional bin-packing problem
- New lower bounds for the three-dimensional finite bin packing problem
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- Heuristic algorithms for the three-dimensional bin packing problem
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1300390 (Why is no real title available?)
- scientific article; zbMATH DE number 1128822 (Why is no real title available?)
- A Genetic Algorithm for Solving the Container Loading Problem
- A Method for Solving Container Packing for a Single Size of Box
- A family of genetic algorithms for the pallet loading problem
- A new exact method for the two-dimensional orthogonal packing problem
- An AND/OR-graph approach to the container loading problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An analysis of lower bound procedures for the bin packing problem
- An exact algorithm for the pallet loading problem
- An improved typology of cutting and packing problems
- Capacitated Vehicle Routing on Trees
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Exact solution of the two-dimensional finite bin packing problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Hybrid genetic algorithms for bin-packing and related problems
- Lower bounds and reduction procedures for the bin packing problem
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Multistage Cutting Stock Problems of Two and More Dimensions
- New bin packing fast lower bounds
- 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
- Probabilistic Analysis of a Generalized Bin Packing Problem and Applications
- Sequential vector packing
- The Three-Dimensional Bin Packing Problem
- The pallet packing problem for non-uniform box sizes
- Three-dimensional packing of items with limited load bearing strength
- Two- and three-dimensional parametric packing
Cited in
(5)- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- The load-balanced multi-dimensional bin-packing problem
- A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce
- The master bay plan problem: a solution method based on its connection to the three-dimensional bin packing problem
This page was built for publication: A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2404356)
