Logic based Benders' decomposition for orthogonal stock cutting problems
From MaRDI portal
Publication:1652086
DOI10.1016/j.cor.2016.09.009zbMath1391.90514OpenAlexW2519499514MaRDI QIDQ1652086
Manuel Iori, Silvano Martello, Maxence Delorme
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/588348
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Constraint programming and operations research, An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time, Network scheduling problem with cross-docking and loading constraints, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, Logic-Based Benders Decomposition for Large-Scale Optimization, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Mathematical models and decomposition methods for the multiple knapsack problem, Exact solution techniques for two-dimensional cutting and packing, Multi-warehouse package consolidation for split orders in online retailing, Logic-based Benders decomposition algorithm for contamination detection problem in water networks, Exact optimization and decomposition approaches for shelf space allocation, A branch-and-price algorithm for the temporal bin packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- An exact strip packing algorithm based on canonical forms
- Models and algorithms for packing rectangles into the smallest square
- Scheduling inspired models for two-dimensional packing problems
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- Optimal rectangle packing
- Packing into the smallest square: worst-case analysis of lower bounds
- A branch and bound algorithm for the strip packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Partitioning procedures for solving mixed-variables programming problems
- On genetic algorithms for the packing of polygons
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Worst-case analysis of fast heuristics for packing squares into a square
- Logic-based Benders decomposition
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A tabu search algorithm for the pallet loading problem
- A branch-and-cut algorithm for the pallet loading problem
- An exact algorithm for the pallet loading problem
- Two-dimensional packing problems: a survey
- Exhaustive approaches to 2D rectangular perfect packings
- A new constraint programming approach for the orthogonal packing problem
- Resource augmentation in two-dimensional packing with orthogonal rotations
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- The pallet loading problem: a review of solution methods and computational experiments
- An Exact Approach to the Strip-Packing Problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
