Exact algorithms for the guillotine strip cutting/packing problem.
From MaRDI portal
Publication:1406705
DOI10.1016/S0305-0548(98)00008-2zbMath1040.90568MaRDI QIDQ1406705
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang ⋮ An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ Single workgroup scheduling problem with variable processing personnel ⋮ An exact method for the 2D guillotine strip packing problem ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A reference length approach for the 3D strip packing problem ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ Scheduling inspired models for two-dimensional packing problems ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ A hierarchy of relaxations for linear generalized disjunctive programming ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing ⋮ Order and static stability into the strip packing problem ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ A combined approach to the solution to the general one-dimensional cutting stock problem
Cites Work
- Unnamed Item
- Unnamed Item
- Average-case analysis of cutting and packing in two dimensions
- Expected performance of the shelf heuristic for 2-dimensional packing
- Dynamic programming algorithms for the zero-one knapsack problem
- The trim-loss and assortment problems: A survey
- Bin packing can be solved within 1+epsilon in linear time
- Simple perfect squared square of lowest order
- Pipeline architectures for dynamic programming algorithms
- On genetic algorithms for the packing of polygons
- A recursive exact algorithm for weighted two-dimensional cutting
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An improved version of Wang's algorithm for two-dimensional cutting problems
- A typology of cutting and packing problems
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Algorithms for Packing Squares: A Probabilistic Analysis
- Fast Approximation Algorithms for Knapsack Problems
- Two-dimensional packing: expected performance of simple level algorithms
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- The Theory and Computation of Knapsack Functions
