The three-dimensional knapsack problem with balancing constraints
From MaRDI portal
Recommendations
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- The load-balanced multi-dimensional bin-packing problem
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- The Three-Dimensional Bin Packing Problem
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
Cites work
- scientific article; zbMATH DE number 429663 (Why is no real title available?)
- scientific article; zbMATH DE number 2050782 (Why is no real title available?)
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A new exact method for the two-dimensional orthogonal packing problem
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- A typology of cutting and packing problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An analytical model for the container loading problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An improved typology of cutting and packing problems
- An integer-programming-based heuristic for the balanced loading problem
- Balanced Loading
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- Extreme point-based heuristics for three-dimensional bin packing
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Loading Multiple Pallets
- Multistage Cutting Stock Problems of Two and More Dimensions
- New classes of fast lower bounds for bin packing problems
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- On Packing Two-Dimensional Bins
- On the two-dimensional knapsack problem
- Optimal aircraft load balancing
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- The Three-Dimensional Bin Packing Problem
- The dimensional family approach in (hyper)sphere packing: A typological study of new patterns, structures, and interdimensional functions
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Two-Dimensional Finite Bin-Packing Algorithms
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(17)- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- Two-dimensional knapsack-block packing problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- scientific article; zbMATH DE number 7656032 (Why is no real title available?)
- A new load balance methodology for container loading problem in road transportation
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Weight distribution in container loading: a case study
- Metaheuristics for truck loading in the car production industry
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- Container packing problem with balance constraints
- A data-driven approach for mixed-case palletization with support
- The load-balanced multi-dimensional bin-packing problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Exploiting packing components in general-purpose integer programming solvers
- A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
This page was built for publication: The three-dimensional knapsack problem with balancing constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q440966)
