A note on the approximability of cutting stock problems (Q2643962): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Eduardo Candido Xavier / rank
Normal rank
 
Property / author
 
Property / author: Eduardo Candido Xavier / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.053 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111519706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Packing Two-Dimensional Bins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line algorithm for multidimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem / 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: The modified integer round-up property of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem / 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: An LP-based approach to cutting stock problems with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank

Latest revision as of 13:22, 26 June 2024

scientific article
Language Label Description Also known as
English
A note on the approximability of cutting stock problems
scientific article

    Statements

    A note on the approximability of cutting stock problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2007
    0 references
    bin packing
    0 references

    Identifiers