Combinatorial Benders' Cuts for the Strip Packing Problem
From MaRDI portal
Publication:2935306
DOI10.1287/opre.2013.1248zbMath1302.90173OpenAlexW1969327924WikidataQ59222237 ScholiaQ59222237MaRDI QIDQ2935306
Manuel Iori, Jean-François Côté, Mauro Dell'Amico
Publication date: 22 December 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/17a0a2ff49cc869a14e6ac448182a01eb98daf22
Related Items
Constraint programming and operations research, An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem, A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, Logic based Benders' decomposition for orthogonal stock cutting problems, An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem, Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation, Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints, The multi-period multi-trip container drayage problem with release and due dates, Triple-solution approach for the strip packing problem with two-staged patterns, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, The pallet-loading vehicle routing problem with stability constraints, Matheuristics: survey and synthesis, A new search procedure for the two-dimensional orthogonal packing problem, Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows, Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem, The Meet-in-the-Middle Principle for Cutting and Packing Problems, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, Logic-Based Benders Decomposition for Large-Scale Optimization, Combinatorial Benders cuts for assembly line balancing problems with setups, The Benders decomposition algorithm: a literature review, The value of integrating loading and routing, Mathematical models and decomposition methods for the multiple knapsack problem, A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem, 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, Exact solution techniques for two-dimensional cutting and packing, The multiple multidimensional knapsack with family-split penalties, The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem, Logic-based Benders decomposition algorithm for contamination detection problem in water networks, The maximum diversity assortment selection problem, Two-bar charts packing problem, New Lower Bound and Exact Method for the Continuous Berth Allocation Problem, A hybrid metaheuristic for the two-dimensional strip packing problem, On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs, Exact optimization and decomposition approaches for shelf space allocation, Order assignment and scheduling under processing and distribution time uncertainty, Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs, A branch-and-price algorithm for the temporal bin packing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An exact strip packing algorithm based on canonical forms
- Scheduling inspired models for two-dimensional packing problems
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution
- Rectangle packing with one-dimensional resource augmentation
- Strip packing with precedence constraints and strip packing with release times
- Reactive GRASP for the strip-packing problem
- Bidimensional packing by bilinear programming
- 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
- Logic-based Benders decomposition
- Exhaustive approaches to 2D rectangular perfect packings
- Generalized Benders decomposition
- A new exact method for the two-dimensional orthogonal packing problem
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- An Exact Approach to the Strip-Packing Problem
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- A SAT Encoding for Multi-dimensional Packing Problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- A (5/3 + ε)-Approximation for Strip Packing
- LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
