Dynamic programming algorithms for generating optimal strip layouts (Q2506184): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded knapsack problem: Dynamic programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting stock problem and its solution in the manufacturing industry of large electric generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating optimal cutting patterns for rectangular blanks of a single size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-exchange heuristic for nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating optimal T-shape cutting patterns for circular blanks / rank
 
Normal rank

Revision as of 21:00, 24 June 2024

scientific article
Language Label Description Also known as
English
Dynamic programming algorithms for generating optimal strip layouts
scientific article

    Statements

    Identifiers