A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Computational Study of Search Strategies for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-project for mixed 0-1 programming: recent progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization / 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: Solving binary cutting stock problems by column generation and branch- and-bound / 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: LP models for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithm for Minimising the Number of Setups in 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: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths / 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: A new model for complete solutions to one-dimensional cutting stock problems. / 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: The modified integer round-up property of the one-dimensional cutting stock problem / 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: Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming models for 2-staged two-dimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening Chvátal-Gomory cuts and Gomory fractional cuts / 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: Q4821303 / 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 13:27, 11 June 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
scientific article

    Statements

    A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (English)
    0 references
    0 references
    27 December 2005
    0 references
    cutting
    0 references
    cutting planes
    0 references
    column generation
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers