A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Integer Rounding for Polymatroid and Branching Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4141851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Trim Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Carathéodory bounds for integer cones / 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: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin Packing with Fixed Number of Bins Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / 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: New cases of the cutting stock problem having MIRUP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for integer programming covering problems satisfying the integer round-up property / 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

Latest revision as of 07:27, 6 July 2024

scientific article
Language Label Description Also known as
English
A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption
scientific article

    Statements

    A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (English)
    0 references
    0 references
    0 references
    28 March 2013
    0 references
    cutting stock
    0 references
    algorithms
    0 references
    modified integer round-up property
    0 references

    Identifiers