An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems

DOI10.1080/00207543.2010.493535MaRDI QIDQ2967574zbMATH OpenOpenAlexFDO

Authors

Publication date 1 March 2017

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207543.2010.493535

zbMATH Keywords

optimisationbranch-and-boundtwo-dimensional cutting problem

Mathematics Subject Classification ID

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

Recommendations

• A 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
• An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
• Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem

Cites work

• A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
• A comparative numerical analysis for the guillotine two-dimensional cutting problem
• A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
• A recursive exact algorithm for weighted two-dimensional cutting
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
• An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• Exact algorithms for large-scale unconstrained two and three staged cutting problems
• Linear models for 1-group two-dimensional guillotine cutting problems
• T-shape homogeneous block patterns for the two-dimensional cutting problem
• The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
• The Theory and Computation of Knapsack Functions
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

Cited in

(9)

• Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• Exact approaches for the unconstrained two-dimensional cutting problem with defects
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• 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
• A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.

This page was built for publication: An improved 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 Q2967574)