A minimum concave-cost dynamic network flow problem with an application to lot-sizing

DOI10.1002/NET.3230150107MaRDI QIDQ3703618zbMATH OpenOpenAlexFDO

Authors Stephen C. Graves, James B. Orlin

Publication date 1985

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230150107

zbMATH Keywords

deterministic demanddiscounted costinfinite-horizon, lot-sizing problemlong-run average-cost per periodminimum-cost dynamic network flowperiodic datapolynomial algorithmsspecial network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05) Deterministic network models in operations research (90B10)

Recommendations

• TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
• Minimum Convex Cost Dynamic Network Flows
• scientific article; zbMATH DE number 4149861
• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
• Minimum concave cost flow over a grid network

Cites work

• Combinatorial optimization with rational objective functions
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3148886 (Why is no real title available?)

Cited in

(14)

• The minimal average cost flow problem
• Capacity optimization and competition with cyclical and lead-time-dependent demands
• Perspectives of Monge properties in optimization
• An approximation algorithm for a general class of multi-parametric optimization problems
• An approximation algorithm for a general class of parametric optimization problems
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
• On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
• TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
• scientific article; zbMATH DE number 4149861 (Why is no real title available?)
• Minimum Convex Cost Dynamic Network Flows
• scientific article; zbMATH DE number 4085384 (Why is no real title available?)
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.

This page was built for publication: A minimum concave-cost dynamic network flow problem with an application to lot-sizing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703618)