Network Flow Algorithms - Softcover

Williamson, David P.

 
9781316636831: Network Flow Algorithms
Softcover
ISBN 10: 1316636836 ISBN 13: 9781316636831
Publisher: Cambridge University Press, 2019

Synopsis

Offers an up-to-date, unified treatment of combinatorial algorithms to solve network flow problems for graduate students and professionals.

"synopsis" may belong to another edition of this title.

About the Author

David P. Williamson is a Professor at Cornell University, New York, in the School of Operations Research and Information Engineering. He has won several awards for his work in discrete optimization, including the 2000 Fulkerson Prize, sponsored by the American Mathematical Society and the Mathematical Programming Society. His previous book, The Design of Approximation Algorithms (Cambridge, 2011), co-authored with David B. Shmoys, won the 2013 INFORMS Lanchester Prize. He has served on several editor boards, and was editor-in-chief of the SIAM Journal on Discrete Mathematics. He is a Fellow of the ACM and of SIAM.

"About this title" may belong to another edition of this title.

Publisher
Cambridge University Press
Publication date
2019
Language
English
ISBN 10 
1316636836
ISBN 13 
9781316636831
Binding
Paperback
Edition number
1
Number of pages
326

Other Popular Editions of the Same Title

9781107185890: Network Flow Algorithms

Featured Edition

ISBN 10:  1107185890 ISBN 13:  9781107185890
Publisher: Cambridge University Press, 2019
Hardcover