A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00291-014-0363-x / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00291-014-0363-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981367194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining cutting stock patterns when defects are present / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP algorithm for constrained two-dimensional non-guillotine cutting 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: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A population heuristic for constrained two-dimensional non-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: An efficient approach for large-scale two-dimensional guillotine cutting stock 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: A new upper bound for unconstrained two-dimensional cutting and packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / 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: The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems / 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: An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach / 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: A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Guillotineable-Layout Cutting Problems with a Single Defect - An AND/OR-Graph Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cutting-wrapping problem in the textile industry: Optimal overlap of fabric lengths and defects for maximizing return based on quality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated defect detection and optimization for cross cutting of wooden boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine cutting of defective boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting rectangles avoiding rectangular defects / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00291-014-0363-X / rank
 
Normal rank

Latest revision as of 18:49, 9 December 2024

scientific article
Language Label Description Also known as
English
A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
scientific article

    Statements

    A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 December 2014
    0 references
    two-dimensional cutting
    0 references
    defects
    0 references
    computational complexity
    0 references
    dynamic programming
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references