Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Networks in Action: Text and Computer Exercises in Network Optimization

Networks in Action: Text and Computer Exercises in Network Optimization

Ghosh, Diptesh
Sierksma, Gerard

Hardcover

Series: International Operations Research & Management Science, Book 140

Business GeneralGeneral ComputersProgramming

ISBN10: 1441955127
ISBN13: 9781441955128
Publisher: Springer
Published: Dec 22 2009
Pages: 184
Weight: 1.02
Height: 0.50 Width: 6.14 Depth: 9.21
Language: English
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.

1 different editions

Also available

Also from

Sierksma, Gerard

View All

Also in

Business General

View All