Skip to main content
SpringerLink
Log in

Nonconvex Network Flow Problems

NNFP

  • Reference work entry
Encyclopedia of Optimization

  • 207 Accesses

Article Outline

Keywords

See also

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  2. Balakrishnan A, Magnanti TL, Wong RT (1989) A dual-ascent procedure for large scale uncapacitated network design. Oper Res 37:716–740

    MathSciNet  MATH  Google Scholar 

  3. Bell GB, Lamar BW (1997) Solution methods for nonconvex network problems. In: Pardalos PM, Hearn DW, Hager WW (eds) Network Optimization. Lectures Notes Economics and Math Systems. Springer, Berlin, pp 32–50

    Google Scholar 

  4. Charnes A, Cooper WW (1961) Management models and industrial applications of linear programming. Wiley, New York

    MATH  Google Scholar 

  5. Cruz FRB, Macgregor Smith J, Mateus GR (1998) Solving to optimality the uncapacitiated fixed-charge network flow problem. Comput Oper Res 25:67–81

    MathSciNet  MATH  Google Scholar 

  6. Daskin MS (1995) Network and discrete location. Wiley, New York

    MATH  Google Scholar 

  7. Dolan RJ (1987) Quantity discounts: Managerial issues and research opportunities. Marketing Sci 6:1–22

    Google Scholar 

  8. Erickson RE, Monna CL, Veinott AF (1987) Send-and-split method for minimum concave-cost network flows. Math Oper Res 12:634–664

    MathSciNet  MATH  Google Scholar 

  9. Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26:992–1009

    MathSciNet  MATH  Google Scholar 

  10. Feltenmark S, Lindberg PO (1997) Network methods for head-dependent hydro power scheduling. In: Pardalos PM, Hearn DW, Hager WW (eds) Network Optimization, Lectures Notes Economics and Math Systems. Springer, Berlin, pp 249–264

    MathSciNet  Google Scholar 

  11. Fisher ML (1985) An applications oriented guide to Lagrangian relaxation. Interfaces 15:10–21

    Google Scholar 

  12. Florian M (1986) Nonlinear cost network models in transportation analysis. In: Gallo G, Sandi C (eds) Netflow at Pisa, Math Program Stud. North-Holland, Amsterdam, pp 167–196

    MathSciNet  MATH  Google Scholar 

  13. Gallo G, Sandi C, Sodini C (1980) An algorithm for the min concave cost flow problem. Europ J Oper Res 4:248–255

    MathSciNet  MATH  Google Scholar 

  14. Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of NP-completeness. Freeman, New York

    MATH  Google Scholar 

  15. Glover F, Klingman D, Phillips NV (1992) Network models in optimization and their applications in practice. Wiley, New York

    Google Scholar 

  16. Glover F, Laguna M (1997) Tabu search. Kluwer, Dordrecht

    MATH  Google Scholar 

  17. Graves SC, Orlin JB (1985) A minimum concave-cost dynamic network flow problem with applications to lot sizing. Networks 15:59–71

    MathSciNet  MATH  Google Scholar 

  18. Guisewite GM (1995) Network models. In: Horst R, Pardalos PM (eds) Handbook Global Optim. Kluwer, Dordrecht, pp 609–648

    Google Scholar 

  19. Guisewite GM, Pardalos PM (1990) Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Ann Oper Res 25:75–100

    MathSciNet  MATH  Google Scholar 

  20. Guisewite GM, Pardalos PM (1991) Algorithms for the single-source uncapacitated minimum concave-cost network flow problem. J Global Optim 1:245–265

    MathSciNet  MATH  Google Scholar 

  21. Guisewite GM, Pardalos PM (1992) Performance of local search in minimum concave-cost network flow problems. In: Floudas CA, Pardalos PM (eds) Recent Advances in Global Optimization. Princeton Univ. Press, Princeton, pp 50–75

    Google Scholar 

  22. Horst R, Pardalos PM, Thoai NV (1995) Introduction to global optimization. Kluwer, Dordrecht

    MATH  Google Scholar 

  23. Jensen PA, Barnes JW (1980) Network flow programming. Wiley, New York

    MATH  Google Scholar 

  24. Jorjani S, Lamar BW (1994) Cash flow management network modelling with quantity discounting. OMEGA Internat J Management Sci 22:149–155

    Google Scholar 

  25. Klinz B, Tuy H (1993) Minimum concave-cost network flow problems with a single nonlinear arc cost. In: Du D-Z, Pardalos PM (eds) Network Optimization Problems: Algorithms, Applications, and Complexity. World Sci., Singapore, pp 125–146

    Google Scholar 

  26. Lamar BW (1993) An improved branch and bound algorithm for minimum concave cost network flow problems. J Global Optim 3:261–287

    MathSciNet  MATH  Google Scholar 

  27. Lamar BW (1993) A method for solving network flow problems with general nonlinear arc costs. In: Du D-Z, Pardalos PM (eds) Network Optimization Problems: Algorithms, Applications, and Complexity. World Sci., Singapore, pp 147–167

    Google Scholar 

  28. Lamar BW (1996) A note on formulating nonconvex network optimisation problems. Techn Report Dept Management Univ Canterbury

    Google Scholar 

  29. Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transport Sci 18:1–55

    Google Scholar 

  30. Soland RM (1974) Optimal facility location with concave costs. Oper Res 22:373–382

    MathSciNet  MATH  Google Scholar 

  31. Tuy H (1995) D.C. optimization: Theory, methods, and algorithms. In: Horst R, Pardalos PM (eds) Handbook Global Optim. Kluwer, Dordrecht, pp 149–216

    Google Scholar 

  32. Yaged B (1971) Minimum cost routing for static network models. Networks 1:139–172

    MathSciNet  MATH  Google Scholar 

  33. Zangwill WI (1968) Minimum concave cost flows in certain networks. Managem Sci 14:429–450

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Economic and Decision Analysis Center, The MITRE Corp., Bedford, USA

    Bruce W. Lamar

Authors
  1. Bruce W. Lamar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Lamar, B.W. (2008). Nonconvex Network Flow Problems . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_443

Download citation

Publish with us

Policies and ethics

Search

Navigation