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

DOI10.1016/S0167-6377(03)00002-6zbMath1088.90050OpenAlexW2066434945MaRDI 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)

Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00002-6

zbMATH Keywords

OptimizationBranch and boundCutting problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85) Combinatorial optimization (90C27)

Related Items (12)

Exact algorithm for generating two-segment cutting patterns of punched strips ⋮ Sequential heuristic for the two-dimensional bin-packing problem ⋮ An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems ⋮ Two-stage general block patterns for the two-dimensional cutting problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems ⋮ A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects ⋮ T-shape homogeneous block patterns for the two-dimensional cutting problem ⋮ Simple 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

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

This page was built for publication: A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.