Tighter relaxations for the cutting stock problem (Q1806682): 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: Q4398379 / 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: The cutting stock problem and integer rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: An instance of the cutting stock problem for which the rounding property does not hold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modified integer round-up property of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Rounding for Polymatroid and Branching Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New cases of the cutting stock problem having MIRUP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040780 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:59, 29 May 2024

scientific article
Language Label Description Also known as
English
Tighter relaxations for the cutting stock problem
scientific article

    Statements

    Tighter relaxations for the cutting stock problem (English)
    0 references
    0 references
    0 references
    0 references
    8 November 1999
    0 references
    linear programming relaxation
    0 references
    cutting stock problem
    0 references
    integer linear programming
    0 references
    integer round-up property
    0 references

    Identifiers