Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q4880190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter relaxations for the cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848284 / 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: 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: Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study / rank
 
Normal rank

Latest revision as of 15:22, 4 June 2024

scientific article
Language Label Description Also known as
English
Families of non-IRUP instances of the one-dimensional cutting stock problem
scientific article

    Statements

    Families of non-IRUP instances of the one-dimensional cutting stock problem (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2002
    0 references
    one-dimensional cutting stock problem
    0 references
    continuous relaxation
    0 references
    integer round-up property
    0 references

    Identifiers