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.
"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: 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: WeBuyBooks, Rossendale, LANCS, United Kingdom
hardcover. Condition: Like New. Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind. Seller Inventory # rev2910998961
Quantity: 1 available
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
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. Seller Inventory # GOR010703249
Quantity: 1 available
Seller: Chiron Media, Wallingford, United Kingdom
Hardcover. Condition: New. Brand new book, sourced directly from publisher. Dispatch time is 9-10 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Seller Inventory # 6666-ELS-9781898563914
Quantity: Over 20 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: 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: 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
Quantity: 2 available
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: new. Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781898563914
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: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. 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. Num Pages: 204 pages, illustrations. BIC Classification: PB. Category: (G) General (US: Trade). Dimension: 230 x 156 x 13. Weight in Grams: 330. . 2003. 1st Edition. hardcover. . . . . Seller Inventory # V9781898563914
Quantity: 10 available