The one-dimensional cutting stock problem with due dates (Q1038325): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: One-dimensional cutting stock optimization in consecutive time periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: New integer programming formulations and an exact algorithm for the ordered cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem / rank
 
Normal rank
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: Part 2, Benchmark Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / 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 new model for complete solutions to one-dimensional cutting stock problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-job Cutting Stock Problem with Due Dates and Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order Allocation for Stock Cutting in the Paper Industry / 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: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography / 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: Solving binary cutting stock problems by column generation and branch- and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm solution for one-dimensional bundled stock cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated cutting stock and sequencing problem / rank
 
Normal rank

Latest revision as of 04:17, 2 July 2024

scientific article
Language Label Description Also known as
English
The one-dimensional cutting stock problem with due dates
scientific article

    Statements

    The one-dimensional cutting stock problem with due dates (English)
    0 references
    0 references
    0 references
    17 November 2009
    0 references
    cutting
    0 references
    integer programming
    0 references
    scheduling
    0 references

    Identifiers