An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
From MaRDI portal
Publication:2967574
DOI10.1080/00207543.2010.493535zbMath1356.90124OpenAlexW2066520832MaRDI QIDQ2967574
No author found.
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, Exact approaches for the unconstrained two-dimensional cutting problem with defects, A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
Cites Work
- T-shape homogeneous block patterns for the two-dimensional cutting problem
- A recursive exact algorithm for weighted two-dimensional cutting
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- Linear models for 1-group two-dimensional guillotine cutting problems
- The Theory and Computation of Knapsack Functions
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems