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.
"Sinopsis" puede pertenecer a otra edición de este libro.
David K. Smith, University of Exeter, UK
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: WeBuyBooks, Rossendale, LANCS, Reino Unido
hardcover. Condición: 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. Nº de ref. del artículo: rev2910998961
Cantidad disponible: 1 disponibles
Librería: WorldofBooks, Goring-By-Sea, WS, Reino Unido
Hardback. Condición: 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. Nº de ref. del artículo: GOR010703249
Cantidad disponible: 1 disponibles
Librería: Anybook.com, Lincoln, Reino Unido
Condición: 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. Nº de ref. del artículo: 9421204
Cantidad disponible: 1 disponibles
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Questo è un articolo print on demand. Nº de ref. del artículo: 40e032e6a2427db95cb24de97d67a111
Cantidad disponible: Más de 20 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
Hardcover. Condición: New. Nº de ref. del artículo: 6666-ELS-9781898563914
Cantidad disponible: Más de 20 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. pp. 204. Nº de ref. del artículo: 25096185
Cantidad disponible: 3 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. illustrated edition. 200 pages. 9.25x6.25x0.25 inches. In Stock. Nº de ref. del artículo: __1898563918
Cantidad disponible: 2 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 204. Nº de ref. del artículo: 2617387558
Cantidad disponible: 3 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9781898563914
Cantidad disponible: 2 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. pp. 204. Nº de ref. del artículo: 1817387564
Cantidad disponible: 3 disponibles