Networks in Action

Most books covering network optimization explain the theory but offer only exercises that support the understanding of that theory, and case studies that are offered are not suitable for classroom analysis, either because data sets are missing or they're just too large to handle in the classroom. Networks in Action: Text and Computer Exercises in Network Optimization contains a wide range of not-too-large network optimization problems that need to be analyzed and solved by using the computer. Using case studies based on a single fictitious company throughout, the book presents exercises in each chapter that are at once small enough to solve in the classroom, while too large to be solved by eye.

After providing an overview of the modeling and implementing process, a look at network theory, and comprehensive listing of references with comments, the book looks shortest paths, minimum spanning trees, network flows, matchings, facility location, and cyclic routing on networks. Each chapter contains exercises that have been rigorously classroom-tested. The result is a perfect text for a one-semester course on network optimization, whether at the advanced undergraduate or the graduate level within an operations research program, econometrics, or as part of an MBA program.

Texte du rabat

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.

Contenu

The Modeling and Implementing Process.- Network Theory.- References with Comments.- Shortest Paths.- Minimum Spanning Trees.- Network Flows.- Matchings.- Facility Location.- Cyclic Routing on Networks.- Erratum.