Combinatorial Benders' cuts for the strip packing problem
From MaRDI portal
Publication:2935306
Recommendations
- Logic based Benders' decomposition for orthogonal stock cutting problems
- A logic-based benders decomposition approach for the 3-staged strip packing problem
- An exact algorithm for the two-dimensional strip-packing problem
- An exact approach to the strip-packing problem
- An exact strip packing algorithm based on canonical forms
Cites work
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- A Linear Programming Approach to the Cutting-Stock Problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A SAT encoding for multi-dimensional packing problems
- A SAT-based method for solving the two-dimensional strip packing problem
- A \((5/3 + \varepsilon )\)-approximation for strip packing
- A branch and bound algorithm for the strip packing problem
- A near-optimal solution to a two-dimensional cutting stock problem
- A new exact method for the two-dimensional orthogonal packing problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- An Algorithm for Two-Dimensional Cutting Problems
- An exact algorithm for the two-dimensional strip-packing problem
- An exact approach to the strip-packing problem
- An exact strip packing algorithm based on canonical forms
- Bidimensional packing by bilinear programming
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Exact solution of the two-dimensional finite bin packing problem
- Exhaustive approaches to 2D rectangular perfect packings
- Generalized Benders decomposition
- LP bounds in an interval-graph algorithm for orthogonal-packing feasibility
- Logic-based Benders decomposition
- Multistage Cutting Stock Problems of Two and More Dimensions
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Reactive GRASP for the strip-packing problem
- Rectangle packing with one-dimensional resource augmentation
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Scheduling inspired models for two-dimensional packing problems
- Strip packing with precedence constraints and strip packing with release times
- Two-Dimensional Finite Bin-Packing Algorithms
Cited in
(46)- The multi-period multi-trip container drayage problem with release and due dates
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- Exact solution techniques for two-dimensional cutting and packing
- The value of integrating loading and routing
- Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- Constraint programming and operations research
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- New lower bound and exact method for the continuous berth allocation problem
- The Benders decomposition algorithm: a literature review
- Mathematical models and decomposition methods for the multiple knapsack problem
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- Order assignment and scheduling under processing and distribution time uncertainty
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- The multiple multidimensional knapsack with family-split penalties
- Matheuristics: survey and synthesis
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Triple-solution approach for the strip packing problem with two-staged patterns
- The maximum diversity assortment selection problem
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- Two-bar charts packing problem
- Combinatorial Benders cuts for assembly line balancing problems with setups
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- A new search procedure for the two-dimensional orthogonal packing problem
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem
- The pallet-loading vehicle routing problem with stability constraints
- Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
- Logic-based Benders decomposition algorithm for contamination detection problem in water networks
- Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
- A hybrid metaheuristic for the two-dimensional strip packing problem
- Logic-based Benders decomposition for large-scale optimization
- Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem
- Exact optimization and decomposition approaches for shelf space allocation
- A branch-and-price algorithm for the temporal bin packing problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- A logic-based benders decomposition approach for the 3-staged strip packing problem
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
- Combinatorial Benders decomposition for the operational aircraft maintenance routing problem
- Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
This page was built for publication: Combinatorial Benders' cuts for the strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935306)
