Skip to main content
SpringerLink
Log in

Auction Algorithms

  • Reference work entry
Book cover Encyclopedia of Optimization

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 1,699.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bertsekas, D.P.: ‘A distributed algorithm for the assignment problem’, Working Paper MIT Lab. Information & Decision Systems (1979).

    Google Scholar 

  2. Bertsekas, D.P.: Linear network optimization: Algorithms and codes, MIT, 1991.

    Google Scholar 

  3. Bertsekas, D.P.: ‘Auction algorithms for network flow problems: A tutorial introduction’, Comput. Optim. Appl.1 (1992), 7–66.

    MathSciNet  MATH  Google Scholar 

  4. Bertsekas, D.P.: Network optimization: Continuous and discrete problems, Athena Sci., 1998.

    Google Scholar 

  5. Bertsekas, D.P., and Castañon, D.A.: ‘The auction algorithm for transportation problems’, Ann. Oper. Res.20 (1989), 67–96.

    MathSciNet  MATH  Google Scholar 

  6. Bertsekas, D.P., Castañon, D.A., Eckstein, J., and Zenios, S.: ‘Parallel computing in network optimization’, in M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (eds.): Handbooks in OR and MS, Vol. 7, North-Holland, 1995, pp. 331–399.

    Google Scholar 

  7. Bertsekas, D.P., and Tsitsiklis, J.N.: Parallel and distributed computation: Numerical methods, Prentice-Hall, 1989.

    Google Scholar 

  8. Castañon, D.A.: ‘Reverse Auction Algorithms for Assignment Problems’, in D.S. Johnson, and C.C. McGeoch (eds.): Algorithms for network flows and matching, Amer. Math. Soc., 1993, pp. 407–429.

    Google Scholar 

  9. Tseng, P., and Bertsekas, D.P.: ‘An epsilon-relaxation method for separable convex cost generalized network flow problems’, Math. Program. (to appear), MIT Lab. Information & Decision Systems P-2374 (1996).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Labor. Information and Decision Systems Massachusetts Inst. Technol., Cambridge, MA, 02139, USA

    Dimitri P. Bertsekas

Authors
  1. Dimitri P. Bertsekas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Chemical Engin., Princeton Univ., Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optim. Dept. Industrial and Systems Engin., Univ. Florida, Gainesville, FL, 32611, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this entry

Cite this entry

Bertsekas, D.P. (2001). Auction Algorithms . In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/0-306-48332-7_15

Download citation

  • DOI: https://doi.org/10.1007/0-306-48332-7_15

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-6932-5

  • Online ISBN: 978-0-306-48332-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation