Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: California Books, Miami, FL, USA
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press CUP, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: Books Puddle, New York, NY, USA
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 56,81
Anzahl: 1 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 52,04
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
EUR 59,79
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New.
EUR 72,36
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 314 pages. 9.00x6.00x1.00 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: PAPER CAVALIER UK, London, Vereinigtes Königreich
EUR 95,25
Anzahl: 1 verfügbar
In den WarenkorbZustand: new. New!
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: moluna, Greven, Deutschland
EUR 56,83
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. This comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 122,76
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: California Books, Miami, FL, USA
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 111,86
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 127,26
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 111,85
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Offers an up-to-date, unified treatment of combinatorial algorithms to solve network flow problems for graduate students and professionals.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
EUR 127,24
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 130,00
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Cambridge University Press, GB, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
EUR 149,63
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: New. 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.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 161,65
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
EUR 163,37
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 314 pages. 9.25x6.25x1.00 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 166,93
Anzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: New. New. book.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. 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.
Sprache: Englisch
Verlag: Cambridge University Press, GB, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
EUR 140,54
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: New. 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.
Sprache: Englisch
Verlag: Cambridge University Press, Cambridge, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Paperback. Zustand: new. Paperback. 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. This comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 48,45
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 314 pages. 9.00x6.00x1.00 inches. In Stock. This item is printed on demand.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
EUR 53,42
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Sprache: Englisch
Verlag: Cambridge University Press, Cambridge, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
EUR 60,20
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: new. Paperback. 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. This comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Sprache: Englisch
Verlag: Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 124,79
Anzahl: 4 verfügbar
In den WarenkorbZustand: New. Print on Demand pp. 328.
Sprache: Englisch
Verlag: Cambridge University Press, Cambridge, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Hardcover. Zustand: new. Hardcover. 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. This comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.