Networks Graphs Techniques Computational by Smith (5 results)

- Softcover
Seller: Anybook.com, Lincoln, United KingdomAnybook.com
Contact seller5-star sellerCondition: Used - Fair
US$ 33.21
US$ 17.79 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,400grams, ISBN:9781898563914. …

- Hardcover
Seller: WorldofBooks, Goring-By-Sea, WS, United KingdomWorldofBooks
Contact seller5-star sellerCondition: Used - Very good
US$ 89.06
US$ 7.54 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardback. Condition: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 79.97
US$ 78.60 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Networks and Graphs | Techniques and Computational Methods | D K Smith | Taschenbuch | Englisch | 2003 | Elsevier Science | EAN 9781898563914 | Verantwortliche Person für die EU: Elsevier B.V., Radarweg 29, 1043 NX AMSTERDAM, NIEDERLANDE, productsafety[at]elsevier[dot]com | Anbieter: preigu. …

- Hardcover
Seller: BennettBooksLtd, Los Angeles, CA, U.S.A.BennettBooksLtd
Contact seller5-star sellerCondition: New
US$ 151.81
US$ 6.95 shippingShips within U.S.A.Quantity: 1 available
Hardcover. Condition: New. In shrink wrap. Looks like an interesting title.

- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 102.16
US$ 39.30 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Dr Smith here presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research. He shows how algorithms can be used for finding optimal paths and flows, identifying trees in networks, and optimal matching. Later chapters discuss postman and salesperson tours, and demonstrate how many network problems are related to the ''minimal-cost feasible-flow'' problem. Techniques are presented both informally and with mathematical rigour and aspects of computation, especially of complexity, have been included. Numerous examples and diagrams illustrate the techniques and applications. The book also includes problem exercises with tutorial hints.…