The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127613595, #quickstatements; #temporary_batch_1722796506534
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Mhand Hifi / rank
Normal rank
 
Property / author
 
Property / author: Mhand Hifi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure / 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: Pipeline architectures for dynamic programming algorithms / 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: An approximation algorithm for solving unconstrained two-dimensional knapsack 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: 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: Mathematical Methods of Organizing and Planning Production / 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: An improved version of Wang's algorithm for two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonorthogonal Two-Dimensional Cutting Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693257 / 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: 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
Property / cites work
 
Property / cites work: Q3724077 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(96)00060-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160776415 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127613595 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:36, 4 August 2024

scientific article
Language Label Description Also known as
English
The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
scientific article

    Statements

    The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (English)
    0 references
    22 February 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    weighted and unweighted unconstrained two-dimensional guillotine cutting
    0 references
    depth-first search
    0 references
    hill-climbing
    0 references
    one-dimensional knapsack
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references