Optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs

European Journal of Operational Research

Volumn 122, Issue 3, 2000, Pages 602-610

  Lan, Yu Feng ^a   Wang, Yue Li ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; TREES (MATHEMATICS);

CACTUS GRAPHS; LINEAR TIME COMPLEXITY ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0033882859     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00080-6     Document Type: Article

References (17)

1. V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. G. Chartrand, O.R. Oellermann, Applied and Algorithmic Graph Theory, McGraw-Hill, New York, 1993.
3. Chen M.L., Francis R.L., Lawrence J.F., Lowe T.J., Tufekci S. Block-vertex duality and the one-median problem. Networks. 15:1986;395-412.
4. R.L. Francis, L.F. McGinnis, J.A. White, Facility Layout and Locations: An Analytical Approach, Prentice-Hall, Englewood Cliffs, NJ, 1992.
5. Goldman J. Optimum center location in simple networks. Transportation Science. 5:1971;212-221.
6. Gurevich Y., Stockmeyer L., Vishkin U. Solving NP-hard problems on graphs that are almost trees and an application to facility location. Journal of the Association of Computer Machinery. 31:1984;459-473.
7. G.Y. Handler, P.B. Mirchandani, Location on Networks: Theory and Algorithms, MIT Press, Cambridge, MA, 1979.
8. Kincaid R.K., Lower T.J. Locating an absolute center on graphs that are almost trees. European Journal of Operational Research. 44:1990;357-372.
9. Koontz W.L.G. Economic evaluation of loop feeder relief alternatives. The Bell System Technical Journal. 59:1980;277-281.
10. Korach E., Rotem D., Santoro N. Distributed algorithms for finding centers and medians in networks. ACM Transactions on Programming Languages and Systems. 6:1984;390-401.
11. Kuratowski K. Sur le probleme des courbes gauches en topologie. Fundamental Mathematics. 15:1930;271-283.
12. O. Maimon, R.K. Kincaid, Material handling system design for flexible manufacturing systems: A network approach, Working paper, Department of Mathematics, College of William and Mary, Williamsburg, VA.
13. E. Minieka, Optimization Algorithms for Networks and Graphs, Marcel Dekker, New York, 1978.
14. P.B. Mirchandani, R.L. Francis, Discrete Location Theory, Wiley, New York, 1990.
15. Peng S., Lo W. Efficient algorithms for finding a core of a tree with a specified length. Journal of Algorithms. 20:1996;445-458.
16. Tansel B.C., Francis R.L., Lowe T.J. Location on networks: A survey. Management Science. 29:1983;482-511.
17. Tarjan R.E. Depth first search and linear graph algorithms. SIAM Journal on Computing. 1:1972;146-160.