Geodesic
A Note on the Continuous p-Defense-Sum Problem
Yugoslav journal of operations research, Tome 10 (2000) no. 2, p. 299 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

The continuous p-defense-sum problem consists of locating p facilities in a convex polyhedron, such that the sum of the distances among all their pairs is maximized. We indicate that it is sufficient to search for optimal sites at the polyhedron's vertices only, and show that the optimal solution can be degenerate, i.e., more than one facility being located at the same point. An integer programming formulation is also given, taking the possible degeneracy into account.
Classification : 90B85
Keywords: Optimization, location, p-defense-sum, degeneracy. 
@article{YJOR_2000_10_2_a9,
     author = {N. Mladenovi\'c and F. Plastria},
     title = {A {Note} on the {Continuous} {p-Defense-Sum} {Problem}},
     journal = {Yugoslav journal of operations research},
     pages = {299 },
     year = {2000},
     volume = {10},
     number = {2},
     zbl = {1006.90054},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2000_10_2_a9/}
}
TY  - JOUR
AU  - N. Mladenović
AU  - F. Plastria
TI  - A Note on the Continuous p-Defense-Sum Problem
JO  - Yugoslav journal of operations research
PY  - 2000
SP  - 299 
VL  - 10
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/YJOR_2000_10_2_a9/
LA  - en
ID  - YJOR_2000_10_2_a9
ER  - 
%0 Journal Article
%A N. Mladenović
%A F. Plastria
%T A Note on the Continuous p-Defense-Sum Problem
%J Yugoslav journal of operations research
%D 2000
%P 299 
%V 10
%N 2
%U http://geodesic.mathdoc.fr/item/YJOR_2000_10_2_a9/
%G en
%F YJOR_2000_10_2_a9
N. Mladenović; F. Plastria. A Note on the Continuous p-Defense-Sum Problem. Yugoslav journal of operations research, Tome 10 (2000) no. 2, p. 299 . http://geodesic.mathdoc.fr/item/YJOR_2000_10_2_a9/