A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.

DOI10.1016/S0167-6377(03)00002-6zbMath1088.90050MaRDI QIDQ1413922

Young-Gun G, Maing-Kyu Kang, Young-Jo Seong

Publication date: 17 November 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

Optimization; Branch and bound; Cutting problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B85: Continuous location

90C27: Combinatorial optimization

Related Items

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

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