Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2163313667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Economic Lot Size Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Lot Sizing Model with Learning in Setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction Mappings in the Theory Underlying Dynamic Programming / 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: Improved complexity bounds for location problems on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic Lot-Sizing Problem with Startup and Reservation Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Deterministic Dynamic Product Cycling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the dynamic lot-sizing problem with learning effect in setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of the economic lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>T</i><sup>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / 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: Speed-Up in Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach / rank
 
Normal rank

Latest revision as of 16:26, 22 May 2024

scientific article
Language Label Description Also known as
English
Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
scientific article

    Statements

    Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (English)
    0 references
    0 references
    0 references
    0 references
    19 February 1995
    0 references
    computational analysis
    0 references
    geometric techniques
    0 references
    dynamic programs
    0 references
    economic lot-sizing
    0 references

    Identifiers