Networks in action : text and computer exercises in network optimization / by Gerard Sierksma, Diptesh Ghosh
- 作者： Sierksma, Gerard.
- 其他作者：
- 其他題名：
- Springer eBooks
- Text and computer exercises in network optimization
- 出版： Boston, MA : Springer Science+Business Media, LLC 2010
- 叢書名： International series in operations research & management science ,v.140
- 主題： Network analysis (Planning) , Mathematical optimization. , Economics/Management Science. , Operations Research/Decision Theory. , Operations Research, Mathematical Programming. , Math Applications in Computer Science. , Business/Management Science, general. , Optimization. , Algorithms.
- ISBN： 9781441955135 (electronic bk.) 、 9781441955128 (paper)
- URL：
電子書
-
讀者標籤：
- 系統號： 005172345 | 機讀編目格式
館藏資訊
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.