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

DOI10.1016/S0167-6377(03)00002-6MaRDI QIDQ1413922zbMATH OpenOpenAlexFDO

Authors Young-Gun G, Young-Jo Seong, 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) Combinatorial optimization (90C27) Continuous location (90B85)

Recommendations

• An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• A new upper bound for unconstrained two-dimensional cutting and packing
• A recursive algorithm for constrained two-dimensional cutting problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

Cites work

• A new upper bound for unconstrained two-dimensional cutting and packing
• A recursive exact algorithm for weighted two-dimensional cutting
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Algorithm for Two-Dimensional Cutting Problems
• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• The Theory and Computation of Knapsack Functions
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

Cited in

(16)

• Simple block patterns for the two-dimensional cutting problem
• An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• T-shape homogeneous block patterns for the two-dimensional cutting problem
• Two-stage general block patterns for the two-dimensional cutting problem
• Bounds for Two-Dimensional Cutting
• A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
• Exact approaches for the unconstrained two-dimensional cutting problem with defects
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• Sequential heuristic for the two-dimensional bin-packing problem
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
• A recursive algorithm for constrained two-dimensional cutting problems
• Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
• Exact algorithm for generating two-segment cutting patterns of punched strips
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1413922)