Integer linear programming models for the skiving stock problem (Q322686): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6636142 / rank
 
Normal rank
Property / zbMATH Keywords
 
packing
Property / zbMATH Keywords: packing / rank
 
Normal rank
Property / zbMATH Keywords
 
skiving stock problem
Property / zbMATH Keywords: skiving stock problem / rank
 
Normal rank
Property / zbMATH Keywords
 
dual bin packing
Property / zbMATH Keywords: dual bin packing / rank
 
Normal rank
Property / zbMATH Keywords
 
modeling
Property / zbMATH Keywords: modeling / rank
 
Normal rank
Property / zbMATH Keywords
 
continuous relaxation
Property / zbMATH Keywords: continuous relaxation / rank
 
Normal rank

Revision as of 03:18, 28 June 2023

scientific article
Language Label Description Also known as
English
Integer linear programming models for the skiving stock problem
scientific article

    Statements

    Integer linear programming models for the skiving stock problem (English)
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    packing
    0 references
    skiving stock problem
    0 references
    dual bin packing
    0 references
    modeling
    0 references
    continuous relaxation
    0 references