1983
DOI: 10.1287/mnsc.29.4.482
|View full text |Cite
|
Sign up to set email alerts
|

State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems

Abstract: Please scroll down for article-it is on subsequent pages With 12,500 members from nearly 90 countries, INFORMS is the largest international association of operations research (O.R.) and analytics professionals and students. INFORMS provides unique networking and learning opportunities for individual professionals, and organizations of all types and sizes, to better understand and use O.R. and analytics tools and methods to transform strategic visions and achieve better outcomes. For more information on INFORMS… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
79
0
1

Year Published

1990
1990
2017
2017

Publication Types

Select...
8
2

Relationship

1
9

Authors

Journals

citations
Cited by 320 publications
(82 citation statements)
references
References 0 publications
0
79
0
1
Order By: Relevance
“…O problema resolvido, como proposto antes, tem solução com qualidade reconhecida na literatura 30 . O peso atribuído a cada nó de demanda foi considerado diferente em cada etapa, pois esta probabilidade tende a diminuir conforme o nível do serviço oferecido pelo hospital aumenta.…”
Section: Métodosunclassified
“…O problema resolvido, como proposto antes, tem solução com qualidade reconhecida na literatura 30 . O peso atribuído a cada nó de demanda foi considerado diferente em cada etapa, pois esta probabilidade tende a diminuir conforme o nível do serviço oferecido pelo hospital aumenta.…”
Section: Métodosunclassified
“…On a network, the absolute p-center model allows facilities to be located on the nodes and the links, while the vertex p-center model restricts sites to the nodes. Tansel et al [59] provide an excellent survey of early work on the median and center problems.…”
Section: Discrete Location Modelsmentioning
confidence: 99%
“…Covering problems can be categorized as the set coverage problems (SCP) [12,13,14] and the maximal covering location problems (MCLP) [15,16,17]. The p-MP aims to find the locations of p facilities among n candidate locations such that the total weighted distance between all demands and their nearest facilities is minimized [18]. It arises naturally in both public and private sector for locating plants, factories, warehouses or emergency stations to serve/satisfy demand at other plants, warehouses or incident locations.…”
Section: Introductionmentioning
confidence: 99%