Order Total (1 Item Items):
Shipping Destination:
Network Flow Algorithms by Williamson David (37 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (37)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (35)
- As New, Fine or Near Fine (2)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (7)
- Not Print on Demand (24)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Condition: New.
-
NETWORK FLOW ALGORITHMS
Language: English
Published by Cambridge University Press CUP, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Condition: New.
-
NETWORK FLOW ALGORITHMS
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Condition: New.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 43.64
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
NETWORK FLOW ALGORITHMS
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Condition: New.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Condition: New.
-
Paperback. Condition: Brand New. 314 pages. 9.00x6.00x1.00 inches. In Stock.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Condition: new. New!
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Condition: 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.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Condition: New.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Condition: New.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 93.82
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Condition: As New. Unread book in perfect condition.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Taschenbuch. Condition: 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.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 109.03
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, GB, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
£ 129.25
Free Shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: 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.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Condition: New.
-
Hardcover. Condition: Brand New. 314 pages. 9.25x6.25x1.00 inches. In Stock.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Hardcover. Condition: New. New. book.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Buch. Condition: 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.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, GB, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
£ 117.86
£ 65 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: 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.
-
Network Flow Algorithms (Paperback)
Language: English
Published by Cambridge University Press, Cambridge, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Paperback. Condition: 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.
-
Paperback. Condition: Brand New. 314 pages. 9.00x6.00x1.00 inches. In Stock. This item is printed on demand.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
£ 44.81
£ 16.04 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Network Flow Algorithms (Paperback)
Language: English
Published by Cambridge University Press, Cambridge, 2019
ISBN 10: 1316636836 ISBN 13: 9781316636831
Paperback. Condition: 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.
-
Network Flow Algorithms
Language: English
Published by Cambridge University Press, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Condition: New. Print on Demand pp. 328.
-
Network Flow Algorithms (Hardcover)
Language: English
Published by Cambridge University Press, Cambridge, 2019
ISBN 10: 1107185890 ISBN 13: 9781107185890
Hardcover. Condition: 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.
