A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2006.08.014 / 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: Near-optimal solutions to one-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of roll cutting in clothing industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential heuristic procedure for one-dimensional cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Approximation Scheme for Variable-Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the variable sized bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with divisible item sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for packing and scheduling problems. (Abstract of thesis) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple knapsack problem / 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: Using Extra Dual Cuts to Accelerate Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Optimal Inequalities for Stabilized Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal solutions for the cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Methods of Organizing and Planning Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / 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: Exact Algorithm for Minimising the Number of Setups in 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 / DOI
 
Property / DOI: 10.1016/J.COR.2006.08.014 / rank
 
Normal rank

Latest revision as of 09:07, 10 December 2024

scientific article
Language Label Description Also known as
English
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
scientific article

    Statements

    A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (English)
    0 references
    1 September 2008
    0 references
    multiple length cutting stock
    0 references
    branch-and-price-and-cut
    0 references
    column generation
    0 references
    stabilization of column generation
    0 references

    Identifiers