Stock cutting to minimize cutting length (Q1266563): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum area circumscribing polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic optimization: The Fermat-Weber location problem / 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: Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition / 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: A Linear Programming Approach to the Cutting Stock Problem—Part II / 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: Q5807665 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:35, 28 May 2024

scientific article
Language Label Description Also known as
English
Stock cutting to minimize cutting length
scientific article

    Statements