Algorithms for the single-source uncapacitated minimum concave-cost network flow problem

This publication has 16 references indexed in Scilit:

• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
  Annals of Operations Research, 1990
• Checking local optimality in constrained quadratic programming is NP-hard
  Operations Research Letters, 1988
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
  Mathematics of Operations Research, 1987
• Constrained Global Optimization: Algorithms and Applications
  Published by Springer Nature ,1987
• Adjacent extreme flows and application to min concave cost flow problems
  Networks, 1979
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
  Management Science, 1976
• The fixed charge problem
  Naval Research Logistics Quarterly, 1970
• An approximative algorithm for the fixed charge problem
  Naval Research Logistics Quarterly, 1969
• A postscript to “Dynamic problems in the theory of the firm”
  Naval Research Logistics Quarterly, 1960
• Dynamic Version of the Economic Lot Size Model
  Management Science, 1958