Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-021-00695-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3130904396 / 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: Q3998396 / 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: The one-dimensional cutting stock problem with usable leftover - a heuristic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting stock problem and its solution in the manufacturing industry of large electric generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cutting stock problem in the canvas industry / 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: 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: The trim-loss and assortment problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cutting stock problem and integer rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern minimisation in cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Problems in Knapsack Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths / 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: A one-dimensional cutting stock problem in the aluminium industry and its solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LP-based approach to cutting stock problems with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic to reduce the number of different patterns in cutting stock problems / rank
 
Normal rank

Latest revision as of 07:17, 27 July 2024

scientific article
Language Label Description Also known as
English
Modified greedy heuristic for the one-dimensional cutting stock problem
scientific article

    Statements

    Modified greedy heuristic for the one-dimensional cutting stock problem (English)
    0 references
    0 references
    0 references
    25 November 2021
    0 references
    optimization
    0 references
    linear programming
    0 references
    heuristic
    0 references
    cutting pattern
    0 references
    bin packing
    0 references
    column generation
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers