One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the strip packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Two-Dimensional Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional heuristics adapted for two-dimensional rectangular strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new constraint programming approach for the orthogonal packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for bounds for higher-dimensional orthogonal packing problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing / 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: Analysis of upper bounds for the pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Approach to the Strip-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Two-Dimensional Finite Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing small boxes into a big box. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of non-IRUP instances of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP models for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving binary cutting stock problems by column generation and branch- and-bound / rank
 
Normal rank

Revision as of 09:54, 2 July 2024

scientific article
Language Label Description Also known as
English
One-dimensional relaxations and LP bounds for orthogonal packing
scientific article

    Statements

    One-dimensional relaxations and LP bounds for orthogonal packing (English)
    0 references
    29 January 2010
    0 references
    packing
    0 references
    relaxation
    0 references
    modeling
    0 references
    conservative scales
    0 references
    dual-feasible function
    0 references
    probing
    0 references
    0 references

    Identifiers