Upgrading arcs to minimize the maximum travel time in a network

Networks

Volumn 47, Issue 2, 2006, Pages 72-80

  Campbell, Ann Melissa ^a   Lowe, Timothy J ^b   Zhang, Li ^c  

^a UNIVERSITY OF IOWA   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c Citadel ^*  (United States)

Author keywords

Arc upgrading; Dynamic programming; Graph diameter; Graph radius; Heuristics; Minimax objective; Tree graphs

Indexed keywords

ARC UPGRADING; GRAPH DIAMETERS; GRAPH RADIUS; HEURISTICS; MINIMAX OBJECTIVE; TREE GRAPHS;

DYNAMIC PROGRAMMING; GRAPH THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; TRANSPORTATION;

TELECOMMUNICATION NETWORKS;

EID: 33645167966     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20097     Document Type: Article

References (33)

1. T. Aykin and G.F. Brown, Interacting new facilities and location-allocation problems, Transport Sci 79 (1994), 501-523.
2. M. Blum, R. Floyd, V. Pratt, R.L. Rivest, and R.E. Tarjan, Time Bounds for Selection, J Comput Syst Sci 7 (1973), 448-461.
3. J.F. Campbell, A. Ernst, and M. Krishnamoorthy, Hub arc location problems: Part 1-Introduction and results, Manage Sci 51 (2005), 1540-1555.
4. J.F. Campbell, A. Ernst, and M. Krishnamoorthy, Hub arc location problems: Part 2 - Formulations and optimal algorithms, Manage Sci 51 (2005), 1555-1571.
5. J.F. Campbell, A. Ernst, and M. Krishnamoorthy, "Hub location problems," Facility location: applications and theory, Z. Drenzner and H. Harnacher (Editors), Springer-Verlag, Berlin, 2002.
6. J.F. Campbell, Integer programming of discrete hub location problems, Eur J Oper Res 72 (1994), 387-405.
7. P.K. Chan, Algorithms for library-specific sizing of combinational logic, Proc 27th DAC Conf, 1990, pp. 353-356.
8. I. Demgensky, H. Noltemeier, and H.-C. Wirth, On the flow cost lowering problem, Eur J Oper Res 137 (2002), 265-271.
9. R.W. Floyd, Algorithm 97: Shortest path, Commun ACM 5 (1962), 345.
10. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company, New York, 1979.
11. G.Y. Handler, Minimax location of a facility in an undirected tree graph, Transport Sci 7 (1973), 287-293.
12. G.Y. Handler and P.B. Mirchandani, Location on networks: Theory and algorithms, MIT Press, Cambridge, MA, 1979.
13. A.V. Iyer and H.D. Ratliff, Accumulation point location on tree networks for guaranteed time distribution. Manage Sci 36(1990), 958-969.
14. B.Y. Kara and B.C. Tansel, On the single-assignment p-hub center problem, Eur J Oper Res 125 (2000), 648-655.
15. J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc Am Math Soc 7 (1956), 48-50.
16. C.L. Li, S.T. McCormick, and D. Simchi-Levi, On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Oper Res Lett 11 (1992), 303-308.
17. P. McGeer, R. Brayton, R. Rudell, and A. Sangiovanni-Vincentelli, Extended stuck-fault testability for combina tional networks, Proc of the 6th MIT Conference on Advanced Research in VLSI, April 1990.
18. P.B. Mirchandani and R.L. Francis, Discrete location theory, John Wiley and Sons, Inc., New York, 1990.
19. S. Nickel, A. Schobel, and T. Sonnebon, Hub location problems in urban traffic networks, Mathematical Methods on Optimization in Transportation Systems, M. Pursula and J. Niittymäki (Editors), Kluwer Academic Publishers, New York, 2001.
20. M.E. O' Kelly, A quadratic integer program for the location of interacting hub facilities, Eur J Oper Res 32 (1987), 393-404.
21. M.E. O'Kelly and H.J. Miller, Solution strategies for the single facility minimax hub location problem, Papers Regional Sci J RSAI 70 (1991), 367-380.
22. D. Paik, S. Reddy, and S. Sahni, Vertex splitting in dags and applications to partial scan designs and lossy circuits, Technical report. University of Florida, Gainesville, FL, 1990.
23. D. Paik, S. Reddy, and S. Sahni, Heuristics for the placement of flip-flops in partial scan designs and for the placement of signal boosters in lossy circuits, Sixth Int Conf on VLSI Design, 1993, pp. 45-50.
24. D. Paik, S. Reddy, and S. Sahni, Deleting vertices in dags to bound path lengths, IEEE Tran Comput 43 (1994), 1091-1096.
25. D. Paik and S. Sahni, Network upgrading problems, Networks 26 (1995), 45-58.
26. R.C. Prim, Shortest connection networks and some generalizations, Bell Syst Tech J 36 (1957), 1389-1401.
27. A.A. Schoone, H.L. Bodlaender, and J. van Leeuwen, Diameter increase caused by edge deletion, J Graph Theory 11 (1987), 409-427.
28. 2) algorithm for the p-median and related problems on tree graphs, Oper Res Lett 19 (1996), 59-64.
29. B.C. Tansel, R.L. Francis, and T.J. Lowe, Location on networks: A survey. Part 1. The p-center and p-median problems, Manage Sci 29 (1983), 482-497.
30. B.C. Tansel, R.L. Francis, and T.J. Lowe, Location on networks: A survey. Part 2. Exploiting tree network structure, Manage Sci 29 (1983), 498-511.
31. B. Yetis and B.C. Tansel, The single-assignment hub covering problem: Models and linearizations, J Oper Res Soc 54 (2003), 59-64.
32. L. Zhang, The p-hub center allocation problem and the qdiscount arc problem, PhD thesis, The University of Iowa, Iowa City, IA, 2004.
33. L. Zhang, A. Campbell, and T. Lowe, Heuristics for q-arc upgrading problems, Working paper, 2004.