The two-dimensional bin packing problem with variable bin sizes and costs

DOI10.1016/j.disopt.2005.01.002zbMath1077.90057OpenAlexW2095219480WikidataQ58826451 ScholiaQ58826451MaRDI QIDQ2568334

Mikkel M. Sigurd, David Pisinger

Publication date: 10 October 2005

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.01.002

zbMATH Keywords

Column generationConstraint programmingCutting and packingBin-packing problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (38)

A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ Models for the two-dimensional two-stage cutting stock problem with multiple stock size ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ An exact method for the 2D guillotine strip packing problem ⋮ Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning ⋮ A new heuristic algorithm for rectangle packing ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A prototype column generation strategy for the multiple container loading problem ⋮ A global optimization point of view to handle non-standard object packing problems ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Metaheuristics for truck loading in the car production industry ⋮ A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber ⋮ Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem ⋮ Exact and heuristic methods for optimizing lock-quay system in inland waterway ⋮ Solving the variable size bin packing problem with discretized formulations ⋮ Heuristic approaches for the two- and three-dimensional knapsack packing problem ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ Exact and heuristic methods for placing ships in locks ⋮ Lower bounds for three-dimensional multiple-bin-size bin packing problems ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition ⋮ Determining the best shipper sizes for sending products to customers ⋮ Heuristics for the variable sized bin-packing problem ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ MIP-based heuristic for non-standard 3D-packing problems ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Resource-Constrained Scheduling with Non-constant Capacity and Non-regular Activities ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis ⋮ Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives ⋮ The nuclear medicine production and delivery problem

Uses Software

• ABACUS
• CPLEX
• OR-Library
• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Recent advances on two-dimensional bin packing problems
• An analytical model for the container loading problem
• A lower bound for the non-oriented two-dimensional bin packing problem
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• Algorithms for packing and scheduling problems. (Abstract of thesis)
• The two-dimensional finite bin packing problem. II: New lower and upper bounds
• On the two-dimensional knapsack problem
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• Variable Sized Bin Packing
• Two-Dimensional Finite Bin-Packing Algorithms
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• The Three-Dimensional Bin Packing Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• New classes of fast lower bounds for bin packing problems

This page was built for publication: The two-dimensional bin packing problem with variable bin sizes and costs