Network Flow Algorithms - Hardcover

Williamson, David P.

Hardcover

ISBN 10: 1107185890 ISBN 13: 9781107185890

Verlag: Cambridge University Press, 2019

Inhaltsangabe

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

Über diesen Titel

Über die Autorin bzw. den Autor

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.

Details zur Ausgabe

• Verlag: Cambridge University Press
• Erscheinungsdatum: 2019
• Sprache: Englisch
• ISBN 10: 1107185890
• ISBN 13: 9781107185890
• Einband: Gebundene Ausgabe
• Anzahl der Seiten: 328
• Kontakt zum Hersteller: Cambridge University Press; https://www.cambridge.org/; ; Via Honduras,15; Pomezia; Italia; 71; Italien