ISBN-13: 9781461425434 / Angielski / Miękka / 2012 / 184 str.
ISBN-13: 9781461425434 / Angielski / Miękka / 2012 / 184 str.
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.
The authors original motivation for the book was a one-semester course on network optimization for senior masters level classes of econometrics and operations research. The textbook is suitable for a middle level course for a student of econometrics or operations research interested not only in reading about network optimization theory, but also providing first-hand experience in solving and analyzing reasonably sized programs with computer software. §Networks in Action: Text and Computer Exercises in Network Optimization should spark students interest in modeling problems as networks, to sensitize them to the fact that elegant and effective solution methods are available once a problem gets modeled as a network, and to guide them to use computer based software tools to solve these problems. Every chapter ends with a brief description of additional exercises that are left unsolved in order to show students that the problems covered in each of the chapters are not the only problems with which network optimization deals.