All listings for this product
About this product
- DescriptionOne of the most well-kwn 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, des), 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 thing else than the problem of ?nding a subset of the objects and the relations, such that a certain optimization objective is satis?ed.
- Author(s)Diptesh Ghosh,Gerard Sierksma
- PublisherSpringer-Verlag New York Inc.
- Date of Publication01/01/2009
- SubjectManagement & Business: General
- Series TitleInternational Series in Operations Research & Management Science
- Series Part/Volume Numberv. 140
- Place of PublicationNew York, NY
- Country of PublicationUnited States
- ImprintSpringer-Verlag New York Inc.
- Content Note96 black & white illustrations, 46 black & white tables, biography
- Weight462 g
- Width156 mm
- Height234 mm
- Spine12 mm
- Format DetailsLaminated cover
- Edition Statement2010
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $79.89Trending at AU $90.22
- AU $17.51Trending at AU $30.26
- AU $31.46Trending at AU $40.54
- AU $22.32Trending at AU $36.99
- AU $40.87Trending at AU $45.02
- AU $35.26Trending at AU $35.78
- AU $36.61Trending at AU $37.24
This item doesn't belong on this page.
Thanks, we'll look into this.