Networks in action : text and computer exercises in network optimization

著者

書誌事項

Networks in action : text and computer exercises in network optimization

Gerard Sierksma, Diptesh Ghosh

(International series in operations research & management science, 140)

Springer, c2010

大学図書館所蔵 件 / 3

この図書・雑誌をさがす

注記

Includes bibliographical references and index

内容説明・目次

内容説明

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 Modeling and Implementing Process.- Network Theory.- References with Comments.- Shortest Paths.- Minimum Spanning Trees.- Network Flows.- Matchings.- Facility Location.- Cyclic Routing on Networks.- Erratum.

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

ページトップへ