A branch and bound algorithm for the strip packing problem
From MaRDI portal
Publication:1017971
Recommendations
- An exact algorithm for the two-dimensional strip-packing problem
- An exact approach to the strip-packing problem
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- An exact strip packing algorithm based on canonical forms
- An exact method for the 2D guillotine strip packing problem
Cites work
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact approach to the strip-packing problem
- An improved typology of cutting and packing problems
- Exact solution of the two-dimensional finite bin packing problem
- Exhaustive approaches to 2D rectangular perfect packings
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Reactive GRASP for the strip-packing problem
- The Three-Dimensional Bin Packing Problem
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-dimensional packing problems: a survey
Cited in
(53)- An exact approach to the strip-packing problem
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- Local search of orthogonal packings using the lower bounds
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- A parallel branch-and-bound approach to the rectangular guillotine strip cutting problem
- One-dimensional relaxations and LP bounds for orthogonal packing
- The value of integrating loading and routing
- Metaheuristics for truck loading in the car production industry
- Exact solution techniques for two-dimensional cutting and packing
- Conservative scales in packing problems
- Exhaustive approaches to 2D rectangular perfect packings
- Upper bounds for heuristic approaches to the strip packing problem
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- LP bounds in various constraint programming approaches for orthogonal packing
- A clique covering MIP model for the irregular strip packing problem
- Approximation Algorithms for Demand Strip Packing
- An exact algorithm for the two-dimensional strip-packing problem
- Exact algorithms for the guillotine strip cutting/packing problem.
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Solving the irregular strip packing problem via guided local search for overlap minimization
- A SAT-based method for solving the two-dimensional strip packing problem
- Scheduling inspired models for two-dimensional packing problems
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- A new search procedure for the two-dimensional orthogonal packing problem
- An exact method for the 2D guillotine strip packing problem
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Recursive algorithm for generating layer patterns for strip packing
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- Fragmentary structures in a two-dimensional strip packing problem
- Triple-solution approach for the strip packing problem with two-staged patterns
- A branch-and-price algorithm for the temporal bin packing problem
- Creating worst-case instances for lower bounds of the 2D strip packing problem
- Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Logic based Benders' decomposition for orthogonal stock cutting problems
- An exact strip packing algorithm based on canonical forms
- A simple randomized algorithm for two-dimensional strip packing
- Combinatorial Benders' cuts for the strip packing problem
- Order and static stability into the strip packing problem
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
This page was built for publication: A branch and bound algorithm for the strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017971)
