Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the lot-sizing polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Approximation--A New Computational Technique in Dynamic Programming: Allocation Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning of Style Goods with High Setup Costs and Forecast Revisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dynamic programming algorithm for the single item capacitated dynamic lot size model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for dynamic lot size models with piecewise linear costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing inventory routing problems with approximate value functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature-based methods for large scale dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems / rank
 
Normal rank

Latest revision as of 00:47, 12 July 2024

scientific article
Language Label Description Also known as
English
Dynamic programming approximation algorithms for the capacitated lot-sizing problem
scientific article

    Statements

    Dynamic programming approximation algorithms for the capacitated lot-sizing problem (English)
    0 references
    0 references
    25 May 2016
    0 references
    approximate dynamic programming
    0 references
    approximation algorithms
    0 references
    data fitting
    0 references
    production and inventory control
    0 references
    mixed integer programming
    0 references
    capacitated lot-sizing
    0 references

    Identifiers

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