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. Problem exercises with tutorial hints. <P>Contents: Ideas and definitions; Trees; Shortest paths; Maximum flows; How to store a network; More about shortest paths; Advanced maximal flow; Minimal-cost, feasible-flow; Matching and assignment; Postman problems; Travelling salesperson problems; Tutorial hints; References; Index.
"synopsis" may belong to another edition of this title.
David K. Smith, University of Exeter, UK
"About this title" may belong to another edition of this title.
Seller: Qwertyword Ltd, Okehampton, DEVON, United Kingdom
Soft cover. Condition: As New. All clean and crisp with no marks or inscriptions. Seller Inventory # 49937dks336
Quantity: 1 available
Seller: Anybook.com, Lincoln, United Kingdom
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. Seller Inventory # 9421204
Quantity: 1 available
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Questo è un articolo print on demand. Seller Inventory # 40e032e6a2427db95cb24de97d67a111
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
Hardcover. Condition: New. Seller Inventory # 6666-ELS-9781898563914
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. illustrated edition. 200 pages. 9.25x6.25x0.25 inches. In Stock. Seller Inventory # __1898563918
Quantity: 2 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 204. Seller Inventory # 25096185
Quantity: 3 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 204. Seller Inventory # 2617387558
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. New copy - Usually dispatched within 4 working days. Seller Inventory # B9781898563914
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 204 pp. Englisch. Seller Inventory # 9781898563914
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. pp. 204. Seller Inventory # 1817387564