文档介绍：NetworksEE E in Action
International Series in Operations
Research & Management Science
Volume 1404044040
For other titles published in this series, go to
ies/6161
Gerard Sierksma • Diptesh Ghosh
Networks in Action
Text puter Exercises work
Optimization
Gerard Sierksma Diptesh Ghosh
Fac. of Economics and Business Department of Production and
University of Groningen Quantitative Methods
9700 AV Groningen Indian Institute of Management
herlands Ahmedabad-380015
g.******@ Vastrapura, India
******@iimahd..in
ISSN 0884-8289
ISBN 978-1-4419-5512-8 e-ISBN 978-1-4419-5513-5
DOI -1-4419-5513-5
Springer New York Dordrecht Heidelberg London
Library of Congress Control Number: 2009940317
© Springer Science
+ Business Media, LLC 2010
All rights reserved. This work may not be translated or copied in whole or in part without the written
permission of the publisher (Springer Science+Business Media, LLC, 233 Spring Street, New York, NY
10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection
with any form of information storage and retrieval, electronic adaptation, computer software, or by similar
or dissimilar methodology now known or hereafter developed is forbidden.
The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are
not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject
to proprietary rights.
Printed on acid-free paper
Springer is part of Springer Science+Business Media ()
Preface
One of the most well-known of work optimization problems is the shortest
path problem, where a shortest connection between two locations in a work
is to be found. This problem is the basis of route planners in vehicles and on the
. Networks are mon structures; they consist primarily of a finite
number of locations (points, nodes), together with a number of links (edges, arcs,
conne