An exact strip packing algorithm based on canonical forms
From MaRDI portal
(Redirected from Publication:339635)
Recommendations
- An exact algorithm for the two-dimensional strip-packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- A branch and bound algorithm for the strip packing problem
- An exact approach to the strip-packing problem
- An exact method for the 2D guillotine strip packing problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2050771 (Why is no real title available?)
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A branch and bound algorithm for the strip packing problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A least wasted first heuristic algorithm for the rectangular packing problem
- A new heuristic recursive algorithm for the strip rectangular packing problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact approach to the strip-packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- An improved typology of cutting and packing problems
- 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
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- Local search algorithms for the rectangle packing problem with general spatial costs
- New heuristic and interactive approaches to 2D rectangular strip packing
- On genetic algorithms for the packing of polygons
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- Orthogonal Packings in Two Dimensions
- Reactive GRASP for the strip-packing problem
- Some experiments with simulated annealing techniques for packing problems
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- The Three-Dimensional Bin Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-dimensional packing problems: a survey
Cited in
(14)- An exact approach to the strip-packing problem
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- The value of integrating loading and routing
- Exact solution techniques for two-dimensional cutting and packing
- Upper bounds for heuristic approaches to the strip packing problem
- An exact algorithm for the two-dimensional strip-packing problem
- A branch and bound algorithm for the strip packing problem
- A SAT-based method for solving the two-dimensional strip packing problem
- Scheduling inspired models for two-dimensional packing problems
- Mathematical models for the berth allocation problem in dry bulk terminals
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Combinatorial Benders' cuts for the strip packing problem
- Order and static stability into the strip packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
This page was built for publication: An exact strip packing algorithm based on canonical forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339635)
