An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Cutting Stock Problems of Two and More Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Methods of Organizing and Planning Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography / 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 Algorithm for Two-Dimensional Cutting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved version of Wang's algorithm for two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for solving unconstrained two-dimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approach for large-scale two-dimensional guillotine cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3724077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An and-or-graph approach for two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Approach to a Class of Integer-Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithms for the zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798484 / rank
 
Normal rank

Latest revision as of 19:37, 27 May 2024

scientific article
Language Label Description Also known as
English
An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
scientific article

    Statements

    An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (English)
    0 references
    0 references
    26 October 1997
    0 references
    0 references
    constrained two-dimensional cutting problem
    0 references
    one-dimensional bounded knapsacks
    0 references
    lower and upper bounds
    0 references
    branching cuts
    0 references