Overview

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.
ISBN-13

9781461425434

ISBN-10

1461425433

Weight

0.63 Pounds

Dimensions

6.10 x 0.45 x 9.25 In

List Price

$54.99

Edition

1st Edition

Format

Paperback

Language

English

Pages

xi, 184 pages

Publisher

Springer

Published On

2012-02-29


View All Offers

Sort by:

Condition
Seller
Seller Comments
Price
✨ Brand New
Seller details
Alibris
★★★★★

Sparks, NV, USA

Print on demand Trade paperback (US). Glued binding. 184 p. Contains: Illustrations, black & white,...
$58.73

 Free delivery by: 30 Mar 2026

Used, Good
Seller details
Bonita
★★★★☆

Santa Clarita, CA, USA

Access codes and supplements are not guaranteed with used items. May be an ex-library book.
$88.58

 Free delivery by: 30 Mar 2026


Bookstores.com relies on cookies to improve your experience.