| 书目名称 | Networks in Action |
| 副标题 | Text and Computer Ex |
| 编辑 | Gerard Sierksma,Diptesh Ghosh |
| 视频video | |
| 概述 | Presents optimization problems small enough to be solved in class yet too large to be solved by eye.Uses fictitious case study format for all exercises.All exercises rigorously classroom-tested.Includ |
| 丛书名称 | International Series in Operations Research & Management Science |
| 图书封面 |  |
| 描述 | 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. |
| 出版日期 | Textbook 2010 |
| 关键词 | Cyclic routing; Facility location; Matchings; Minimum spanning trees; Modeling; Network optimization; Opti |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4419-5513-5 |
| isbn_softcover | 978-1-4614-2543-4 |
| isbn_ebook | 978-1-4419-5513-5Series ISSN 0884-8289 Series E-ISSN 2214-7934 |
| issn_series | 0884-8289 |
| copyright | Springer-Verlag US 2010 |
发表于 2025-3-21 17:27:41
