A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. (Q1413922): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Two-Dimensional Cutting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for unconstrained two-dimensional cutting and packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive exact algorithm for weighted two-dimensional cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems / rank
 
Normal rank

Latest revision as of 12:37, 6 June 2024

scientific article
Language Label Description Also known as
English
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
scientific article

    Statements