An algorithm for the minimum variance point of a network

Pierre Hansen; Maolin Zheng

RAIRO - Operations Research - Recherche Opérationnelle (1991)

  • Volume: 25, Issue: 1, page 119-126
  • ISSN: 0399-0559

How to cite

top

Hansen, Pierre, and Zheng, Maolin. "An algorithm for the minimum variance point of a network." RAIRO - Operations Research - Recherche Opérationnelle 25.1 (1991): 119-126. <http://eudml.org/doc/104996>.

@article{Hansen1991,
author = {Hansen, Pierre, Zheng, Maolin},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {network location; variance of distances; network with given weights; weighted shortest path distances; minimal variance point},
language = {eng},
number = {1},
pages = {119-126},
publisher = {EDP-Sciences},
title = {An algorithm for the minimum variance point of a network},
url = {http://eudml.org/doc/104996},
volume = {25},
year = {1991},
}

TY - JOUR
AU - Hansen, Pierre
AU - Zheng, Maolin
TI - An algorithm for the minimum variance point of a network
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1991
PB - EDP-Sciences
VL - 25
IS - 1
SP - 119
EP - 126
LA - eng
KW - network location; variance of distances; network with given weights; weighted shortest path distances; minimal variance point
UR - http://eudml.org/doc/104996
ER -

References

top
  1. 1. C. BERGE, Espaces Topologiques. Fonctions multivoques, Dunod, Paris, 1966. Zbl0088.14703MR105663
  2. 2. M. L. BRANDEAU and S. S. CHIU, An Overview of Representative Problems in Location Research, Management Science, 1989, 35, pp. 645-674. Zbl0669.90040MR1001482
  3. 3. J. HALPERN and O. MAIMON, Accord and Conflict Among Several Objectives in Locational Decisions on Tree Networks, in "Locational Analysis of Public Facilities" J. F. THISSE and H. G. ZOLLER Eds., Studies in Mathematical and Managerial Economics, pp. 301-314, Amsterdam, North-Holland, 1983. 
  4. 4. G. Y. HANDLER and P. B. MIRCHANDANI, Location on Networks, Cambridge (Mass.), The M.I.T. Press, 1979. Zbl0533.90026MR525692
  5. 5. P. HANSEN, M. LABBE, D. PEETERS and J. F. THISSE, Facility Location Analysis, Fundamentals of Pure and Applied Economics, 1987, 22, pp. 1-67. Zbl0701.00035
  6. 6. P. HANSEN and M. ZHENG, Algorithms for Determining a Lorenz Point on Trees and Networks, RUTCOR Research Report # 55-89 (submitted for publication). 
  7. 7. R. K. KINCAID and O. MAIMON, Locating a Point of Minimum Variance on Triangular Graphs, Transportation Science, 1989, 23, pp. 216-219. Zbl0682.90034MR1013995
  8. 8. R. K. KINCAID and O. MAIMON, A Note on Locating a Central Vertex of a 3-cactus Graph, Computers and Operations Research, 1990, 17, pp. 315-320. Zbl0699.90030MR1043099
  9. 9. O. MAIMON, The Variance Equity Measure in Location Decision Theory, Annals of Operations Research, 1986, 6, pp. 147-160. 
  10. 10. O. MAIMON, An Algorithm for The Lorenz Measure in Locational Decisions on Trees, Journal of Algorithms, 1988, 9, pp. 583-596. Zbl0662.90026MR970195
  11. 11. B. C. TANSEL, R. L. FRANCIS and T. J. LOWE, Location on Networks: A Survey. Part I: The p-Cener and p-Median Problems, Management Science, 1983, 29, pp. 482-497. Zbl0513.90022MR704593
  12. 12. B. C. TANSEL, R. L. FRANCIS and T. J. LOWE, Location on Networks: A Survey. Part II: Exploiting Tree Network Structure, Management Science, 1983, 29, pp. 498-511. Zbl0513.90023MR704594

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.