The complete vertex p-center problem
The vertex p-center problem consists of locating p facilities among a set of M potential sites such that the maximum distance from any demand to its closest located facility is minimized. The complete vertex p-center problem solves the p-center problem for all p from 1 to the total number of sites,...
Enregistré dans:
Auteur principal: | F.Antonio Medrano |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Elsevier
2020
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/d4d62cbe3b094d379bcac9cb3e7f77d5 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Optimal capacitated ring trees
par: Alessandro Hill, et autres
Publié: (2016) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
par: C. Gentile, et autres
Publié: (2017) -
Intersection cuts from multiple rows: a disjunctive programming approach
par: Egon Balas, et autres
Publié: (2013) -
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
par: Thais Ávila, et autres
Publié: (2017) -
Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
par: Christian Artigues, et autres
Publié: (2018)