Skip to main content
SpringerLink
Log in

Auction Algorithms

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

The Auction Process

Optimality Properties at Termination

Computational Aspects: ϵ-Scaling

Parallel and Asynchronous Implementation

Variations and Extensions

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. Bertsekas DP (1979) A distributed algorithm for the assignment problem. Working Paper MIT Lab Information & Decision Systems

    Google Scholar 

  2. Bertsekas DP (1991) Linear network optimization: Algorithms and codes. MIT, Cambridge, MA

    MATH  Google Scholar 

  3. Bertsekas DP (1992) Auction algorithms for network flow problems: A tutorial introduction. Comput Optim Appl 1:7–66

    MathSciNet  MATH  Google Scholar 

  4. Bertsekas DP (1998) Network optimization: Continuous and discrete problems. Athena Sci., Belmont, MA

    Google Scholar 

  5. Bertsekas DP, Castañon DA (1989) The auction algorithm for transportation problems. Ann Oper Res 20:67–96

    MathSciNet  MATH  Google Scholar 

  6. Bertsekas DP, Castañon DA, Eckstein J, Zenios S (1995) Parallel computing in network optimization. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds) Handbooks in OR and MS, vol 7, North-Holland, Amsterdam, pp 331–399

    Google Scholar 

  7. Bertsekas DP, Tsitsiklis JN (1989) Parallel and distributed computation: Numerical methods. Prentice-Hall, Englewood Cliffs, NJ

    MATH  Google Scholar 

  8. Castañon DA (1993) Reverse Auction Algorithms for Assignment Problems. In: Johnson DS, McGeoch CC (eds) Algorithms for network flows and matching. Amer Math Soc, Providence, pp 407–429

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Labor. Information and Decision Systems, Massachusetts Institute Technol., Cambridge, 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. 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

Bertsekas, D.P. (2008). Auction Algorithms . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_22

Download citation

Publish with us

Policies and ethics

Search

Navigation