Combinatorial and Network Algorithms
We shall discuss three classes of algorithms:
Network algorithms which can be adapted to solve various cost functions.
Auction-type algorithms most suitable for parallel and distributed computations.
Stochastic algorithms such as simulated annealing and its siblings.
- D. P. Bertsekas. Linear Network Optimization. MIT Press, Cambridge, MA, 1991.Google Scholar
- D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation. Prentice Hall, Englewood Cliffs, NJ, 1989.Google Scholar
- R. E. Gomory and T. C. Hu. Multi-terminal network flows. SIAM Journal on Applied Mathematics, 9(4):551–570,1961.Google Scholar
- D. Gusfield and R. W. Irving. The Stable Marriage Problem. MIT Press, Cambridge, MA, 1989.Google Scholar
- T. C. Hu. Beauty contests, college admissions and bargaining. Journal of Recreational Mathematics, 14(4):252–261, 1981-82.Google Scholar
- T. C. Hu. Combinatorial Algorithms. Addison-Wesley, Reading, MA, 1982.Google Scholar
© Springer-Verlag Berlin Heidelberg 1993