One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Optimal Integer Solutions to Industrial 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: Pattern reduction in one-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock 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: A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlling Cutting Pattern Changes in One-Dimensional Trim Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional cutting stock problem to minimize the number of different patterns / 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: Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Criss-Cross Method for Solving Linear Programming Problems / rank
 
Normal rank

Latest revision as of 21:00, 24 June 2024

scientific article
Language Label Description Also known as
English
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
scientific article

    Statements

    One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references