A review of extensive facility location in networks

European Journal of Operational Research

Volumn 95, Issue 3, 1996, Pages 592-603

  Mesa, Juan A ^a   Boffey, T Brian ^b  

^a UNIVERSIDAD DE SEVILLA   (Spain)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Extensive facility; Location; Obnoxious facility

Indexed keywords

EID: 0043263378     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00321-5     Document Type: Article

References (62)

1. Akinc, U., and Srikanth, K.M., "Optimal routing and process scheduling for a mobile service facility", Networks 22 (1992) 163-183.
2. Aneja, Y.P., and Nair, K.P.K., "Location of a tree shaped facility in a network", INFOR 30 (1992) 319-324.
3. Batta, R., and Chiu, S.S., "Optimal obnoxious paths on a network: Transportation of hazardous materials", Operations Research 36 (1988) 84-92.
4. Becker, R.I., and Perl, Y., "Finding the two-core of a tree", Discrete Applied Mathematics 11 (1985) 103-113.
5. Berman, O., and Handler, G.Y., "Optimal minimax path of a single service unit on a network to nonservice destinations", Transportation Science 21 (1987) 115-122.
6. Berman, O., and Rahnama, M.R., "Optimal path of a single service unit on a network to a 'nonemergency' destination", Transportation Science 17 (1983) 218-232.
7. Boffey, T.B., and Karkazis, J., "Models and method for location and routing decisions relating to hazardous materials", Studies in Locational Analysis 4(1993) 149-166.
8. Bramel, J., and Simchi-Levi, D., "A location based heuristic for general routing problems", Operations Research, to appear.
9. Buckley, F., and Harary, F., Distance in Graphs, Addison-Wesley, Reading, MA, 1990.
10. Chin, S.-M., and Der-Ming, P., "Bicriterion routing scheme for nuclear spent fuel transportation", Transportation Research Record 1245 (1989) 60-64.
11. Church, R., and Current, J.R., "Maximal covering tree problems", Naval Research Logistics 40 (1993) 129-142.
12. Current, J.R., "The design of a hierarchical transportation network with transshipment facilities", Transportation Science 22 (1988) 270-277.
13. Current, J.R., and Min, H., "Multiobjective design of transportation networks: Taxonomy and annotation", European Journal of Operational Research 26 (1986) 187-201.
14. Current, J.R., and Pirkul, H., "The hierarchical network design problem with transshipment facilities", European Journal of Operational Research 51 (1991) 338-347.
15. Current, J.R., Pirkul, H., and Rolland, E., "Efficient algorithms for solving the shortest covering path problem", Transportation Science 28 (1994) 317-327.
16. Current, J.R., ReVelle, C.S., and Cohon, J.L., "The shortest covering path problem: An application of locational constraints to network design", Journal of Regional Science 24 (1984) 161-183.
17. Current, J.R., ReVelle, C.S., and Cohon, J.L., "The maximum covering/shortest path problem: A multiobjective network design and routing formulation", European Journal of Operational Research 21 (1985) 189-199.
18. Current, J.R., ReVelle, C.S., and Cohon, J.L., "The hierarchical network design problem", European Journal of Operational Research 27 (1986) 57-66.
19. Current, J.R., ReVelle, C.S., and Cohon, J.L., "The median shortest path problem: A multiobjective approach in the design of transportation networks", Transportation Science 21 (1987) 188-197.
20. Current, J.R., ReVelle, C.S., and Cohon, J.L., "The minimum covering/shortest path problem", Decision Theory 19 (1988) 490-503.
21. Current, J.R., and Schilling, D.A., "The covering salesman problem", Transportation Science 23 (1989) 208-213.
22. Current, J.R., and Schilling, D.A., "The median tour and maximal covering tour problems: Formulations and heuristics", European Journal of Operational Research 73 (1994) 114-126.
23. Duin, C., and Volgenant, A., "Reducing the hierarchical network design problem", European Journal of Operational Research 39 (1989) 332-344.
24. Gopalan, R., Batta, R., and Karwan, M.H., "The equity constrained shortest path problem", Computers & Operations Research 17 (1990) 297-307.
25. Gopalan, R., Kolluri, K.S., Batta, R., and Karwan, M.H., "Modelling equity of risk in the transportation of hazardous materials", Operations Research 38 (1990) 961-973.
26. Hakimi, S.L., Schmeichel, E.F., and Labbé, M., "On locating path-or tree-shaped facilities on networks", Networks 23 (1993) 543-555.
27. Hedetniemi, S.M., Cockaine, E.J., and Hedetniemi, S.T., "Linear algorithms for finding the Jordan centre and path centre of a tree", Transportation Science 15 (1981) 98-114.
28. Hutson, V.A., and ReVelle, C.S., "Maximal direct covering tree problems", Transportation Science 23 (1989) 288-299.
29. Hutson, V.A., and ReVelle, C.S., "Indirect covering tree problems on spanning tree networks", European Journal of Operational Research 65 (1993) 20-32.
30. Jacobsen, S.K., and Madsen, O., "A comparative study of heuristics for a two-level location-routing problem", European Journal of Operational Research 5 (1980) 378-387.
31. Jin, H., Batta, R., and Karwan, M.H., "On the analysis of two new models for transporting hazardous materials", Dpt. of Industrial Engineering, SUNY at Buffalo, 1992.
32. Kim, S., Sherali, H.D., and Park, H.-S, "Minisum and minimax paths of a moving facility on a network", Computers and Operations Research 19 (1992) 123-131.
33. Kim, T.U., Lowe, T.J., Ward, J.E., and Francis, R.L., "A minimum length covering subgraph of a network", Annals of Operations Research 18 (1989) 245-260.
34. Kim, T.U., Lowe, T.J., Ward, J.E., and Francis, R.L., "A minimum length covering subtree of a tree", Naval Research Logistics 37 (1990) 309-326.
35. Kim, T.U., Lowe, T.J., and Ward, J.E., "Locating a median subtree on a network", INFOR 29 (1991) 153-166.
36. Kincaid, R.K., Lowe, T.J., and Morin, T.L., "The location of central structures in trees", Computers & Operations Research 15 (1988) 103-113.
37. Labbé, M., and Laporte, G., "Maximizing user convenience and postal service efficiency in post box location", Belgian Journal of Operations Research Statistics and Computer Science 26 (1986) 21-35.
38. Lindner-Dutton, L., Batta, R., and Karwan, M.H., "Equitable sequencing of a given set of hazardous materials shipments", Transportation Science 25 (1991) 124-137.
39. List, G.F., Mirchandani, P.B., Turnquist, M.A., and Zografos, K.G., "Modeling and analysis for hazardous materials transportation: Risk analysis, routing/scheduling and facility location", Transportation Science 25 (1991) 100-114.
40. List, G.F., and Mirchandani, P.B., "An integrated network/planar multiobjective model for routing and siting for hazardous materials and wastes", Transportation Science 25/2 (1991) 146-156.
41. López de los Mozos, M.C., and Mesa, J.A., "Location of o-cent-dian paths in tree graphs", in: Proceedings of the VI Meeting of the Euro Working Group on Location Analysis, Tenerife, 1992, 135-144.
42. Magnanti, T.L., and Wong, R.T., "Network design and transportation planning: Models and algorithms", Transportation Science 18 (1984) 1-55.
43. Minieka, E., "The optimal location of a path or tree in a tree network", Networks 15 (1985) 309-321.
44. Minieka, E., and Patel, N.H., "On finding the core of a tree with a specified length", Journal of Algorithms 4 (1983) 345-352.
45. Morgan, C.A., and Slater, P.J., "A linear algorithm for a core of a tree", Journal of Algorithms 1 (1980) 247-258.
46. Peng, S., Stephens, A.B., and Yesha, Y., "Algorithms for a core and k-tree core of a tree", Journal of Algorithms 15 (1993) 143-159.
47. Pirkul, H., Current, J.R., and Nagarajan, V., "The hierarchical network design problem: A new formulation and solution procedures", Transportation Science 25 (1991) 175-182.
48. Rabinovitch, R., and Tamir, A., "On a tree-shaped facility location problem of Minieka", Networks 22 (1992) 515-522.
49. ReVelle, C.S., Cohon, J.L., and Shobrys, D., "Simultaneous siting and routing in the disposal of hazardous wastes", Transportation Science 25 (1991) 138-145.
50. ReVelle, C.S., and Laporte, G., "New directions in plant location", Studies in Locational Analysis 4 (1993) 31-58.
51. Richey, M.B., "Optimal location of a path or tree on a network with cycles", Networks 20 (1990) 391-407.
52. Slater, P.J., "Centrality of paths and vertices in a graph: Cores and pits", in: The Theory of Applications of Graphs, Wiley, New York, 1981, 529-542.
53. Slater, P.J., "Locating central paths in a graph", Transportation Science 16 (1982) 1-18.
54. Slater, P.J., Some Definitions of Central Structures, Lecture Notes in Mathematics 1073, Springer-Verlag, Berlin, 1984, 169-178.
55. Sivakumar, R.A., Batta, R., and Karwan, M.H., "A network-based model for transporting extremely hazardous materials", Operations Research Letters 13 (1993) 85-93.
56. Sivakumar, R.A., Batta, R., and Karwan, M.H., "A multiple route conditional risk model for transporting hazardous materials", INFOR, to appear.
57. Stowers, C.L., and Palekar, U.S., "Location models with routing considerations for a single obnoxious facility", Transportation Science 27 (1993) 350-362.
58. Tamir, A., and Lowe, T.J., "The generalized p-forest problem on a tree network", Networks 22 (1992) 217-230.
59. Wijeratne, A.B., and Turnquist, M.A., " Multiobjective routing of hazardous materials in stochastic networks", European Journal of Operational Research 65 (1993) 33-43.
60. Wyman, M.M., and Kuby, M., "Proactive optimization of waste transportation, location and technology", Location Science, to appear.
61. Zografos, K.G., and Davis, C.F., "Multiobjective programming approach for routing hazardous materials", Transportation Engineering. Journal of the ASCE 115 (1989) 661-673.
62. Zografos, K.G., and Samara, S., "Combined location-routing model for hazardous waste transportation and disposal", Transportation Research Records 1245 (1989) 52-59.