A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
From MaRDI portal
Publication:1413922
DOI10.1016/S0167-6377(03)00002-6zbMath1088.90050MaRDI QIDQ1413922
Young-Jo Seong, Young-Gun G, Maing-Kyu Kang
Publication date: 17 November 2003
Published in: Operations Research Letters (Search for Journal in Brave)
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B85: Continuous location
90C27: Combinatorial optimization
Related Items
An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems, A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects, Exact algorithm for generating two-segment cutting patterns of punched strips, Two-stage general block patterns for the two-dimensional cutting problem, T-shape homogeneous block patterns for the two-dimensional cutting problem, A recursive algorithm for constrained two-dimensional cutting problems, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting, Simple block patterns for the two-dimensional cutting problem, Sequential heuristic for the two-dimensional bin-packing problem, An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
Cites Work
- A recursive exact algorithm for weighted two-dimensional cutting
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- A new upper bound for unconstrained two-dimensional cutting and packing
- The Theory and Computation of Knapsack Functions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
