181

References

1. E. Aarts, J.K. Lenstra (Eds.) (1997), Local Search in Combinatorial Optimization,John Wiley & Sons, New York.

2. R.K. Ahuja, T.L. Magnanti, J.B. Orlin (1993), Network Flows; Theory, Algorithmsand Applications, Prentice Hall.

3. J.M. Aldous, R.J. Wilson (2001), Graphs and Applications; an Introductory Ap-proach, Springer.

4. M.S. Bazaraa, J.J. Jarvis, H.D. Sherali (1990), Linear Programming and NetworkFlows, 2nd Edition, John Wiley & Sons, New York.

5. L.D. Bodin, B.L. Golden, A.A. Assad, M.O. Ball (1983), Routing and Scheduling ofVehicles and Crews; the State of the Art, Computers and Operations Research 10,pp. 69-211.

6. J.A. Bondy, U.S.R. Murty (1977), Graph Theory with Applications, American Else-vier Publishing Co., Inc.

7. B.H. Boon, G. Sierksma (2003), Team Formation: Matching Quality Supply andQuality Demand, European Journal of Operational Research 148, pp. 277-292.

8. D.J. Bowersox, D.J. Closs (1996), Logistical Management: the Integrated SupplyChain Process, The McGraw-Hill Companies, Inc.

9. J. Bramel, D. Simchi-Levi (1997), The Logic of Logistics; Theory, Algorithms, andApplications for Logistics Management, Springer-Verlag, New York.

10. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, A. Schrijver (1998), Combinato-rial Optimization, John Wiley & Sons, Inc.

11. V. Chvatal (1983), Linear Programming, W.H. Freeman and Company, New York.12. M.S. Daskin (1995), Network and Discrete Location; Models, Algorithms, and Ap-

plications, John Wiley & Sons, Inc.13. D.-Z. Du, P.M. Pardalos (1998) Handbook of Combinatorial Optimization, Volumes

1, 2, and 3, Springer.14. J.R. Evans, E. Minieka (1992), Optimization Algorithms for Networks and Graphs,

2nd Ed., Marcel Dekker, Inc., New York.15. G. Gutin, A.P. Punnen (Eds.) (2002), The Traveling Salesman Problem and its Vari-

ations, Kluwer Academic Publishers.16. F.S. Hillier, G.J. Lieberman (1995), Introduction to Operations Research, 6th Ed.,

McGraw-Hill, Inc.17. P.A. Jensen, J.F. Bard (2003), Operations Research; Models and Methods, John Wi-

ley & Sons, Inc.18. D. Jungnickel (1999), Graphs, Networks, and Algorithms, Springer-Verlag, Berlin.19. B. Korte, J. Vygen (2002), Combinatorial Optimization; Theory and Algorithms,

2nd Ed., Springer-Verlag.20. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.) (1990), The

Traveling Salesman Problem; a Guided Tour of Combinatorial Optimization, JohnWiley & Sons, Chichester.

21. J. Lee (2004), A First Course in Combinatorial Optimization, Cambridge UniversityPress.

22. P.B. Mirchandani, R.L. Francis (1990), Discrete Location Theory, John Wiley &Sons, Inc.

23. J.M. Padberg (1995), Linear Optimization and Extensions, Springer-Verlag.24. C.H. Papadimitriou, K. Steig1itz (1982), Combinatorial Optimization: Algorithms

and Complexity, Prentice-Hall, Inc., Engelwood Cliffs, N.J.

©Optimization, International Series in Operations Research & Management Science 140,

Springer Science + Business Media, LLC 2010DOI 10.1007/978-1-4419-5513-5,

G. Sierksma and D. Ghosh, Networks in Action: Text and Computer Exercises in Network

182 6 Cyclic Routing on Networks

25. A. Schrijver (1986), Theory of Linear and Integer Programming, John Wiley & Sons,Chichester.

26. A. Schrijver (2003), Combinatorial Optimization: Polyhedra and Efficiency, Vol-umes A, B, and C, Springer.

27. G. Sierksma (2002), Linear and Integer Programming; Theory and Practice, 2ndEd., Marcel Dekker, Inc., New York.

28. G. Sierksma, G.A. Tijssen (1998), Routing Helicopters for Crew Exchanges on Off-shore Locations, Mathematics of Industrial Sciences, Vol. 3, Annals of OperationsResearch, Baltzer’s Publishers.

29. D. Simchi-Levi, P. Kaminski, E. Simchy-Levi (2003), Designing and Manging theSupply Chain; Concepts, Strategies, and Case Studies, McGraw-Hill.

30. H.A. Taha (2003), Operations Research: an Introduction, 7th Ed., Pearson Educa-tion, Inc., Upper Saddle River, N.J.

31. H.P. Williams (1990), Model Building in Mathematical Programming, John Wiley& Sons, Chichester.

32. H.P. Williams (1993), Model Solving in Mathematical Programming, John Wiley &Sons, Chichester.

33. R.J. Wilson, J.J. Watkins (1990), Graphs: an Introductory Approach, John Wiley &Sons, Inc.

34. W.L. Winston (2003), Operations Research: Applications and Algorithms, 4th Ed.,Thomson Brooks/Cole, Thomson Learning, Inc.

35. L.A. Wolsey (1998), Integer Programming, John Wiley & Sons, Inc.

Erratum to:

ISBN 978-1-4419-5512-8

Networks in Action

Gerard Sierksma Diptesh Ghosh

Chapter 1.3 A Linear Programming Formulation Page 20, Formula (1.1), “Maximize” should be “Minimize”. The corrected

formula is as follows:

Chapter 1.6 Exercises on Shortest Path Problems

Page 31, Problem 1.2(d) and (e), “shortest” should be “quickest”.

Chapter 3.3 Linear Programming Formulations Page 71, Fig. 3.10, “Minimize” should be “Maximize”. The corrected

figure is as follows:

Minimize ∑i→ j∈A

wi jxi j.

Maximize

z = xts

Subject to

∑i:k→i∈A

xki− ∑j: j→k∈A

x jk = 0 for each k ∈V.

xi j ≤ ki j for each i→ j ∈ A, except t→ s

xi j ≥ 0 for each i→ j ∈ A

E1

©Optimization, International Series in Operations Research & Management Science 140,

Springer Science + Business Media, LLC 2010DOI 10.1007/978-1-4419-5513-5_10,

G. Sierksma and D. Ghosh, Networks in Action: Text and Computer Exercises in Network

Chapter 3.4 Algorithms for Network Flow Problems

Page 74, Fig. 3.12, the second panels of Iterations 3, 4, and 5, the arrows showing “B ---> C” should be “B <--- C”. The corrected figure is as follows:

E2

Chapter 6.1 Introduction

Page 147, line 4, should be “… the the network is connected and each node in the network has an even degree.”

Chapter 6.6 Exercises on Network Routing Problems

Page 178, Problem 6.5 Designing Bus Routes, line 2, “P” should be “Q”.

E3

Euclerian property, which means that

Index

Access point, 60Algorithm, 7

approximate, 7, 8complete enumeration, 8elementary step, 8exact, 7, 9exhaustive enumeration, see complete

enumeration algorithmFord-Fulkerson’s, 72Kruskal’s, 47–49Prim’s, 44, 47shortest path problem, 22

Bellman and Ford’s, 26Dijkstra’s, 22, 24, 26, 75

Bandwidth, 50, 61Bottleneck, 80, 81, 90Bus routing, 178

Cell formation, 55Checkpoint, 84Commodity flow, 84Connectivity, 37

Demand locations, 79Digraph, see directed graphDistance matrix, 174

Employeefiring, 34hiring, 34training, 34

Graph, 4

acyclic, 6adjacency matrix, 9bipartite, 5, 88

complete, 5complete, 5connectivity, 3cycle, 6directed, 4

arc, 4edge, 4incidence matrix, 9

node arc, 10link, see edgemixed, 5multigraph, 4network, 4node, 4

destination node, 81source node, 81

path, 6length, 6shortest, 7, 17, 22–24, 30, 34, 35, 38

representation, 9simple, 4tour, 6tree, 38

minimum spanning, 38, 39, 43, 44, 46,55

minimum spanning problem, 38spanning, 38

vertex, see nodewalk, 6weighted, 4

18

©Optimization, International Series in Operations Research & Management Science 140,

Springer Science + Business Media, LLC 2010DOI 10.1007/978-1-4419-5513-5,

G. Sierksma and D. Ghosh, Networks in Action: Text and Computer Exercises in Network 3

184 Index

Help desk, 102, 103Heuristic, see approximate algorithm

Incidence matrixmachine-product, 55, 57, 58

Jobdue date, 81, 83preemption, 81release date, 81, 83

Manpower planning, 34Matching

maximal, 88maximum weight, 88perfect, 88stable, 114

Mean, 107

Normal distribution, 107NP-hard, see hard problem

Perturbation function, 101, 110Phone device, 105, 107Planning period, 81Preference

level, 114rating, 114, 115

Problemassignment, 88easy, 8hard, 8location, 137matching

bottleneck, 90non-bipartite, 88roommate, 89

maximum flow, 63minimum cost flow, 62minimum spanning tree, 38

Processing time, 81, 83Production planning, 81Project

stage, 101task, 103–106

Radio telescope, 59Reliability, 52, 55, 80, 85, 107, 137Route

quickest, 31shortest, 31

Scenario, 54, 55Schedule, 81, 173, 174

hiring-firing, 34Scheduling

job shop, 171Service level, 139Soccer, 111Solution

optimal, 7Standard deviation, 107, 108Subsidy, 35, 52, 54

margin, 52Supply chain, 137Switching point, 142

Task, 104Team building, 103Tie-in sale, 108Tolerance

interval, 31, 54, 105, 107upper, 31, 77, 81

Transmission time, 107, 108Transportation

cost, 77plan, 77, 80

TSP, 147, 174, 178heuristic

2-opt, 164, 166, 167, 174, 1782-opt move, 165, 1662-opt neighborhood, 165construction, 163farthest insertion, 163, 165, 174improvement, 163nearest insertion, 161, 163, 164, 174,

178nearest neighbor, 159, 161–163, 172,

174move, 164neighborhood, 164tour, 159, 163

partial, 159

Utilization, 80

VRP, 147Vulnerable connection, see reliability

Warehouse, 77, 139WHPP, 172