Networks in Action: Text and Computer Exercises in Network Optimization

Front Cover
Springer Science & Business Media, Dec 11, 2009 - Business & Economics - 184 pages
0 Reviews
One of the most well-known of all network optimization problems is the shortest path problem, where a shortest connection between two locations in a road network is to be found. This problem is the basis of route planners in vehicles and on the Internet. Networks are very common structures; they consist primarily of a ?nite number of locations (points, nodes), together with a number of links (edges, arcs, connections) between the locations. Very often a certain number is attached to the links, expressing the distance or the cost between the end points of that connection. Networks occur in an extremely wide range of applications, among them are: road networks; cable networks; human relations networks; project scheduling networks; production networks; distribution networks; neural networks; networks of atoms in molecules. In all these cases there are “objects” and “relations” between the objects. A n- work optimization problem is actually nothing else than the problem of ?nding a subset of the objects and the relations, such that a certain optimization objective is satis?ed.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

The Modeling and Implementing Process
1
Network Theory
3
References with Comments
11
Shortest Paths
17
Minimum Spanning Trees
37
Network Flows
61
Matchings
87
Facility Location
116
Cyclic Routing on Networks
143
References
181
Erratum
183
Index
183
Copyright

Other editions - View all

Common terms and phrases