Skip to main content
Springer Nature Link
Log in

Global search algorithms for minimum concave-cost network flow problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We present algorithms for the single-source uncapacitated version of the minimum concave cost network flow problem. Each algorithm exploits the fact that an extreme feasible solution corresponds to a sub-tree of the original network. A global search heuristic based on random extreme feasible initial solutions and local search is developed. The algorithm is used to evaluate the complexity of the randomly generated test problems. An exact global search algorithm is developed, based on enumerative search of rooted subtrees. This exact technique is extended to bound the search based on cost properties and linear underestimation. The technique is accelerated by exploiting the network structure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bornstein C. T. and Rust R. (1988), Minimizing a Sum of Staircase Functions Under Linear Constraints, Optimization 19 (2), 181–190.

    Google Scholar 

  2. Eggleston H. G. (1963), Convexity, Cambridge Tracts in Mathematics and Mathematical Physics No. 47, Cambridge University Press, Cambridge, Mass.

    Google Scholar 

  3. Erickson R. E., Monma C. L., and VeinottJr. A. F. (1987), Send-and-Split Method for Minimum-Concave-Cost Network Flows, Mathematics of Operations Research 12 (4), 634–664.

    Google Scholar 

  4. Falk J. E. and Soland R. M. (1969), An Algorithm for Separable Nonconvex Programming Problems, Management Science 15 (9), 550–569.

    Google Scholar 

  5. Florian M. and Robillard P. (1971), An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem, Management Science 18 (3), 184–193.

    Google Scholar 

  6. Gallo G., Sandi C., and Sodini C. (1980), An Algorithm for the Min Concave Cost Flow Problem, European Journal of Operations Research 4, 249–255.

    Google Scholar 

  7. Gallo G. and Sodini C. (1979), Adjacent Extreme Flows and Application to Min Concave-Cost Flow Problems, Networks 9, 95–121.

    Google Scholar 

  8. Garey M. R. and Johnson D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, CA.

    Google Scholar 

  9. Guisewite, G. M. and Pardalos, P. M. (1990), Algorithms for the Uncapacitated Single-Source Minimum Concave-Cost Network Flow Problem, Working Paper, Department of Computer Science, Pennsylvania State University.

  10. Guisewite G. M. and Pardalos P. M. (1990), Minimum Concave-Cost Network Flow Problems: Applications, Complexity, and Algorithms, Annals of Operations Research 25, 75–100.

    Google Scholar 

  11. Guisewite, G. M. and Pardalos, P. M. (1990), Performance of Local Search in Minimum Concave-Cost Network Flow Problems, Working Paper, Department of Computer Science, Pennsylvania State University.

  12. Lamar B. (1989), An Improved Branch and Bound Algorithm for Minimum Concave Cost Network Flow Problems, Working Paper, Graduate School of Management and Institute of Transportation Studies, University of California, Irvine.

    Google Scholar 

  13. Lozovanu D. D. (1983), Properties of Optimal Solutions of a Grid Transport Problem with Concave Function of the Flows on the Arcs, Engineering Cybernetics 20, 34–38.

    Google Scholar 

  14. Minoux M. (1976), Multiflots de coût minimal avec fonctions de coût concaves, Annals of Telecommunication 31 (3–4), 77–92.

    Google Scholar 

  15. Murty K. G. (1968), Solving the Fixed Charge Problem by Ranking the Extreme Points, Operations Research 16 (2), 268–279.

    Google Scholar 

  16. Papadimitriou C. H. and Steiglitz K. (1982), Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall Inc., Englewood Cliffs, NJ.

    Google Scholar 

  17. Pardalos P. M. (1988), Enumerative Techniques for Solving Some Nonconvex Global Optimization Problems, OR Spektrum 10, 29–35.

    Google Scholar 

  18. Pardalos P. M. (1989), Parallel Search Algorithms in Global Optimization, Applied Mathematics and Computation 29, 219–229.

    Google Scholar 

  19. Plasil J. and Chlebnican P. (1990), A New Algorithm for the Min Concave Cost Flow Problem, Working paper, Technical University of Transport and Communications, Czechoslovakia.

    Google Scholar 

  20. Rech P. and Barton L. G. (1970), A Non-Convex Transportation Algorithm, in E. M. L. Beale (ed.), Applications of Mathematical Programming Techniques, The English Universities Press LTD, London, 250–260.

    Google Scholar 

  21. Soland R. M. (1974), Optimal Facility Location with Concave Costs, Operations Research 22 (2), 373–382.

    Google Scholar 

  22. YagedJr. B. (1971), Minimum Cost Routing for Static Network Models, Networks 1, 139–172.

    Google Scholar 

  23. Zangwill W. I. (1968), Minimum Concave-Cost Flows in Certain Networks, Management Science 14 (7), 429–450.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HRB Systems, State College, PA, U.S.A.

    G. M. Guisewite

  2. University of Florida, 32611, Gainesville, FL, U.S.A.

    P. M. Pardalos

Authors
  1. G. M. Guisewite
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guisewite, G.M., Pardalos, P.M. Global search algorithms for minimum concave-cost network flow problems. J Glob Optim 1, 309–330 (1991). https://doi.org/10.1007/BF00130828

Download citation

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00130828

Key words