One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CUTGEN1 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / 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: Optimal solutions for the cutting stock problem / 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: 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: Cutting stock problems and solution procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern minimisation in cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-dimensional cutting stock problem in the aluminium industry and its solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional cutting stock decisions for rolls with multiple quality grades / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random search in the one-dimensional cutting stock problem / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00239-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995169268 / rank
 
Normal rank

Latest revision as of 11:32, 30 July 2024

scientific article
Language Label Description Also known as
English
One-dimensional cutting stock problem to minimize the number of different patterns
scientific article

    Statements

    One-dimensional cutting stock problem to minimize the number of different patterns (English)
    0 references
    0 references
    0 references
    0 references
    10 April 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    cutting stock problem
    0 references
    pattern minimization
    0 references
    local search
    0 references
    metaheuristics
    0 references
    pattern generation
    0 references
    0 references