Offers an up-to-date, unified treatment of combinatorial algorithms to solve network flow problems for graduate students and professionals.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: medimops, Berlin, Deutschland
Zustand: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present. Artikel-Nr. M01316636836-G
Anzahl: 1 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Artikel-Nr. 369591899
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9781316636831_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. Artikel-Nr. V9781316636831
Anzahl: Mehr als 20 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 314 pages. 9.00x6.00x1.00 inches. In Stock. Artikel-Nr. x-1316636836
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory. Artikel-Nr. 9781316636831
Anzahl: 1 verfügbar