Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (Q1725608): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128756066, #quickstatements; #temporary_batch_1726359655382
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A heuristic approach for big bucket multi-level production planning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on matheuristics for routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multi-item economic lot-sizing with remanufacturing and uncapacitated production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search based matheuristic for nurse rostering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP‐and‐refine matheuristic for smart grid energy management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic lot sizing with product returns and remanufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128756066 / rank
 
Normal rank

Latest revision as of 01:22, 15 September 2024

scientific article
Language Label Description Also known as
English
Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
scientific article

    Statements

    Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    integer programming
    0 references
    lot-sizing
    0 references
    remanufacturing
    0 references
    column generation
    0 references
    matheuristic
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references