An algorithm for the 2D guillotine cutting stock problem (Q1309924): 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: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Packings in Two Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Two-Dimensional Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation / 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: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms / 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: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:06, 22 May 2024

scientific article
Language Label Description Also known as
English
An algorithm for the 2D guillotine cutting stock problem
scientific article

    Statements