A heuristic for the problem of one-dimensional steel coil cutting (Q1983859): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Robinson Hoto / rank
Normal rank
 
Property / author
 
Property / author: Robinson Hoto / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s40314-021-01421-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3128517199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2735077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of hard knapsack problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Variable Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class constrained bin packing revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase roll cutting 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: Multistage Cutting Stock Problems of Two and More Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear optimization model to the compartmentalized knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: VNS matheuristic for a bin packing problem with a color constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained compartmentalised knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the Bounded Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong integer linear optimization model to the compartmentalized knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LP-based approach to a two-stage cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Row and column generation technique for a multistage cutting stock problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:08, 26 July 2024

scientific article
Language Label Description Also known as
English
A heuristic for the problem of one-dimensional steel coil cutting
scientific article

    Statements

    A heuristic for the problem of one-dimensional steel coil cutting (English)
    0 references
    0 references
    0 references
    0 references
    10 September 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    compartmentalized knapsack problem
    0 references
    heuristic
    0 references
    cutting steel coils
    0 references
    discrete linear optimization
    0 references
    0 references