Skip to main content
SpringerLink
Log in

Generalized Networks

GN

  • Reference work entry
Encyclopedia of Optimization

  • 165 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

References

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

    Google Scholar 

  2. Barr R, Glover F, Klingman D (1979) Enhancement of spanning tree labeling procedures for network optimization. INFOR 17:16–34

    MATH  Google Scholar 

  3. Bertsekas D, Tseng P (1988) Relaxation methods for minimum cost ordinary and generalized network flow problems. Oper Res 36(1):93–114

    Article  MathSciNet  MATH  Google Scholar 

  4. Curet ND (1994) An incremental primal-dual method for generalized networks. Comput Oper Res 21(10):1051–1059

    Article  MATH  Google Scholar 

  5. Dantzig GB (1963) Linear programming and extensions. Princeton Univ. Press, Princeton

    MATH  Google Scholar 

  6. Helgason RV, Kennington JL (1995) Primal simplex algorithms for minimum cost network flows. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds) Handbook Oper. Res. and Management Sci. vol 7, Elsevier, Amsterdam

    Google Scholar 

  7. Johnson E (1966) Networks and basic solutions. Oper Res 14:619–623

    Article  Google Scholar 

  8. Kennington JL, Mohamed RA (1997) An efficient dual simplex optimizer for generalized networks. In: Barr R, Helgason R, Kennington J (eds) Interfaces in Computer Sci. and Oper. Res.: Adv. in Metaheuristics, Optimization, and Stochastic Modeling Techniques. Kluwer, Dordrecht

    Google Scholar 

  9. Lustig IJ, Martsten RE, Shanno DF (1994) Interior point methods for linear programming: computational state of the art. ORSA J Comput 6(1):1–14

    MathSciNet  MATH  Google Scholar 

  10. Rardin RL (1998) Optimization in operations research. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Southern Methodist University, Dallas, USA

    Jeffery L. Kennington & Karen R. Lewis

Authors
  1. Jeffery L. Kennington
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karen R. Lewis
    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

Kennington, J.L., Lewis, K.R. (2008). Generalized Networks . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_209

Download citation

Publish with us

Policies and ethics

Search

Navigation