Save up to 30% on Elsevier print and eBooks with free shipping. No promo code needed.
Save up to 30% on print and eBooks.
Networks and Graphs
Techniques and Computational Methods
1st Edition - January 1, 2003
Author: D K Smith
Language: English
Hardback ISBN:9781898563914
9 7 8 - 1 - 8 9 8 5 6 3 - 9 1 - 4
eBook ISBN:9780857099570
9 7 8 - 0 - 8 5 7 0 9 - 9 5 7 - 0
Dr Smith here presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science…Read more
Purchase options
LIMITED OFFER
Save 50% on book bundles
Immediately download your ebook while waiting for your print delivery. No promo code is needed.
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.
Presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research
Demonstrates how algorithms can be used for finding optimal paths and flows, identifying trees in networks and optimal matching
Numerous examples and diagrams illustrate the techniques and applications
Senior undergraduate students and graduate students in mathematics, computer science, and operational research
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.