Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative evaluation of heuristics for container loading / 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: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / 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: Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems / 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: A tabu search algorithm for large-scale guillotine (un)constrained 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: An and-or-graph approach for two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic, first-fit packings in two or more dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load planning for shipments of low density products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3354824 / 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 Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:01, 6 June 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
scientific article

    Statements

    Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (English)
    0 references
    0 references
    15 June 2004
    0 references
    0 references
    combinatorial optimization
    0 references
    cutting problems
    0 references
    exact algorithms
    0 references
    knapsack function
    0 references