Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
From MaRDI portal
Publication:2892309
DOI10.1287/IJOC.1060.0181zbMath1241.90118OpenAlexW2140631835WikidataQ58826439 ScholiaQ58826439MaRDI QIDQ2892309
David Pisinger, Mikkel M. Sigurd
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1060.0181
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (72)
Constraint programming and operations research ⋮ A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ A heuristic for solving large bin packing problems in two and three dimensions ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ Models for the two-dimensional two-stage cutting stock problem with multiple stock size ⋮ A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem ⋮ Models and algorithms for three-stage two-dimensional bin packing ⋮ A constraint programming based column generation approach to nurse rostering problems ⋮ The load-balanced multi-dimensional bin-packing problem ⋮ A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems ⋮ Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Packing ovals in optimized regular polygons ⋮ Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem ⋮ An exact branch-and-price approach for the medical student scheduling problem ⋮ A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem ⋮ Space and time allocation in a shipyard assembly hall ⋮ Routing problems with loading constraints ⋮ Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics ⋮ The off-line group seat reservation problem ⋮ A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ Two dimensional guillotine cutting stock and scheduling problem in printing industry ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ 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 ⋮ Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming ⋮ Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem ⋮ Conservative scales in packing problems ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem ⋮ The three-dimensional knapsack problem with balancing constraints ⋮ A new constraint programming approach for the orthogonal packing problem ⋮ A new exact method for the two-dimensional bin-packing problem with fixed orientation ⋮ Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling ⋮ Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals ⋮ Heuristic approaches for the two- and three-dimensional knapsack packing problem ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Constraint programming-based column generation ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Exact algorithms for the two-dimensional guillotine knapsack ⋮ Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts ⋮ Constraint programming-based column generation ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ An integer programming model for two- and three-stage two-dimensional cutting stock problems ⋮ Unnamed Item ⋮ The Two Dimensional Bin Packing Problem with Side Constraints ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints ⋮ Heuristics for packing semifluids ⋮ Consecutive ones matrices for multi-dimensional orthogonal packing problems ⋮ Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams ⋮ Hybrid approach for the two-dimensional bin packing problem with two-staged patterns ⋮ Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ Bidimensional packing by bilinear programming ⋮ New Lower Bound and Exact Method for the Continuous Berth Allocation Problem ⋮ Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem ⋮ 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 ⋮ A branch-and-price algorithm for the temporal bin packing problem ⋮ Enhanced formulation for the Guillotine 2D Cutting knapsack problem ⋮ Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives
Uses Software
This page was built for publication: Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
