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

This publication has 11 references indexed in Scilit:

• Minimum Convex Cost Dynamic Network Flows
  Mathematics of Operations Research, 1984
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• Parametric shortest path algorithms with an application to cyclic staffing
  Discrete Applied Mathematics, 1981
• Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
  Operations Research, 1975
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
  Management Science, 1969
• Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model
  Management Science, 1969
• Minimum Concave Cost Flows in Certain Networks
  Management Science, 1968
• Some Generalizations of an Inventory Planning Horizon Theorem
  Management Science, 1964
• Dynamic Version of the Economic Lot Size Model
  Management Science, 1958
• On a routing problem
  Quarterly of Applied Mathematics, 1958