The three-dimensional knapsack problem with balancing constraints
From MaRDI portal
Publication:440966
DOI10.1016/j.amc.2012.03.052zbMath1245.90096OpenAlexW2158742617WikidataQ58644416 ScholiaQ58644416MaRDI QIDQ440966
Guido Perboli, Roberto Tadei, Mauro Maria Baldi
Publication date: 19 August 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: http://porto.polito.it/2464177/
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (17)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ The load-balanced multi-dimensional bin-packing problem ⋮ A data-driven approach for mixed-case palletization with support ⋮ A nonlinear optimization model for the balanced vehicle routing problem with loading constraints ⋮ Unnamed Item ⋮ Metaheuristics for truck loading in the car production industry ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Container packing problem with balance constraints ⋮ Exploiting Packing Components in General-Purpose Integer Programming Solvers ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ Two-dimensional knapsack-block packing problem ⋮ A new load balance methodology for container loading problem in road transportation ⋮ Solving 0-1 knapsack problems based on amoeboid organism algorithm ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm ⋮ A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application ⋮ Weight distribution in container loading: a case study
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- The dimensional family approach in (hyper)sphere packing: A typological study of new patterns, structures, and interdimensional functions
- An analytical model for the container loading problem
- An integer-programming-based heuristic for the balanced loading problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- On the two-dimensional knapsack problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A typology of cutting and packing problems
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A new exact method for the two-dimensional orthogonal packing problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- Optimal aircraft load balancing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Two-Dimensional Finite Bin-Packing Algorithms
- On Packing Two-Dimensional Bins
- Balanced Loading
- The Three-Dimensional Bin Packing Problem
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Loading Multiple Pallets
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- New classes of fast lower bounds for bin packing problems
This page was built for publication: The three-dimensional knapsack problem with balancing constraints
