Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
From MaRDI portal
Publication:5085469
DOI10.1287/ijoc.2020.1014OpenAlexW3122681984MaRDI QIDQ5085469
Jean-François Côté, Manuel Iori, Mohamed Haouari
Publication date: 27 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.06835
Related Items (3)
Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem ⋮ Order assignment and scheduling under processing and distribution time uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- The load-balanced multi-dimensional bin-packing problem
- Scheduling inspired models for two-dimensional packing problems
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A survey of dual-feasible and superadditive functions
- Routing problems with loading constraints
- TSpack: A unified tabu search code for multi-dimensional bin packing problems
- Classification and literature review of integrated lot-sizing and cutting stock problems
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Bidimensional packing by bilinear programming
- A branch and bound algorithm for the strip packing problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- On the two-dimensional knapsack problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- BPPLIB: a library for bin packing and cutting stock problems
- Mathematical models and decomposition methods for the multiple knapsack problem
- LP models for bin packing and cutting stock problems
- Conservative scales in packing problems
- Exact solution techniques for two-dimensional cutting and packing
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
- Constraints in container loading -- a state-of-the-art review
- A new constraint programming approach for the orthogonal packing problem
- Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
- Separation algorithms for 0-1 knapsack polytopes
- 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
- Mathematical Methods of Organizing and Planning Production
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- An Exact Approach to the Strip-Packing Problem
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Planning and Scheduling by Logic-Based Benders Decomposition
- Two-Dimensional Finite Bin-Packing Algorithms
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- An Algorithm for Two-Dimensional Cutting Problems
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
