From the median to the generalized center

Pierre Hansen; Martine Labbé; Jacques-François Thisse

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

  • Volume: 25, Issue: 1, page 73-86
  • ISSN: 0399-0559

How to cite

top

Hansen, Pierre, Labbé, Martine, and Thisse, Jacques-François. "From the median to the generalized center." RAIRO - Operations Research - Recherche Opérationnelle 25.1 (1991): 73-86. <http://eudml.org/doc/105004>.

@article{Hansen1991,
author = {Hansen, Pierre, Labbé, Martine, Thisse, Jacques-François},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {assignment; location of a single facility; cent-dian problem; tree; network},
language = {eng},
number = {1},
pages = {73-86},
publisher = {EDP-Sciences},
title = {From the median to the generalized center},
url = {http://eudml.org/doc/105004},
volume = {25},
year = {1991},
}

TY - JOUR
AU - Hansen, Pierre
AU - Labbé, Martine
AU - Thisse, Jacques-François
TI - From the median to the generalized center
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1991
PB - EDP-Sciences
VL - 25
IS - 1
SP - 73
EP - 86
LA - eng
KW - assignment; location of a single facility; cent-dian problem; tree; network
UR - http://eudml.org/doc/105004
ER -

References

top
  1. 1. J. HALPERN, The Location of a Center-Median Convex Combination on an Undirected Tree, J. Regional Sci., 1976, 16, pp. 237-245. 
  2. 2. J. HALPERN, Finding Minimal Center-Median Convex Combinations (Cent-Dian) of a Graph, Management Sci., 1978, 24, pp. 535-544. Zbl0371.90120MR521662
  3. &gt;3. J. HALPERN, Duality in the Cent-Dian of a Graph, Oper. Res., 1980, 28, pp. 722-735. Zbl0451.90050
  4. 4. S.L. AKIMI, Optimal Locations of Switching Centers and the Absolute Centers and Medians of a Graph, Oper. Res., 1964, 12, pp.450-459. Zbl0123.00305
  5. 5. P. HANSEN, M. LABBÉ, D. PEETERS and J.-F. THISSE, Single Facility Location on Networks, Ann. Discrete Math., 1987, 31, pp. 113-146. Zbl0618.90028MR878777
  6. 6. P. HANSEN, J.-F. THISSE, and R. E. WENDELL, Efficient Points on a Network, Networks, 1986, 16, pp. 358-367. Zbl0644.90029MR862893
  7. 7. O. KARIV and S. L. HAKIMI, An Algorithmic Approach to Network Location Problems I: The p-Centers, S.I.A.M. J. Appl. Math., 1979, 37, pp. 513-538. Zbl0432.90074MR549138
  8. 8. M. LABBÉ, Essays in Network Location Theory, Doctoral Dissertation, Université Libre de Bruxelles, 1985. Zbl0576.90023MR797813
  9. 9. F. P. PREPARATA and M. I. SHAMOS, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985. Zbl0759.68037MR805539

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.