Skip to main content

Networks in Action

Text and Computer Exercises in Network Optimization

  • Textbook
  • © 2010

Overview

  • 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
  • Includes supplementary material: sn.pub/extras

Part of the book series: International Series in Operations Research & Management Science (ISOR, volume 140)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

Keywords

About this book

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.

Reviews

From the reviews:

“The book presents in a very interesting way different problems connected with network optimization. … I would strongly recommend the book as a complementary material for a graduate course on network optimization or related subjects.” (Jacek Błazewicz, Zentralblatt MATH, Vol. 1217, 2011)

Authors and Affiliations

  • Fac. Economische Wetenschappen, Vakgroep Marketing & Marketing, Rijksuniversiteit Groningen, Groningen, Netherlands

    Gerard Sierksma

  • Dept. Production & Quantitative Methods, Indian Institute of Management, Ahmedabad, India

    Diptesh Ghosh

Bibliographic Information

Publish with us