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,...
Guardado en:
Autor principal: | F.Antonio Medrano |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2020
|
Materias: | |
Acceso en línea: | https://doaj.org/article/d4d62cbe3b094d379bcac9cb3e7f77d5 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Optimal capacitated ring trees
por: Alessandro Hill, et al.
Publicado: (2016) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017) -
Intersection cuts from multiple rows: a disjunctive programming approach
por: Egon Balas, et al.
Publicado: (2013) -
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
por: Thais Ávila, et al.
Publicado: (2017) -
Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
por: Christian Artigues, et al.
Publicado: (2018)