Geodesic
A Parallel Âranch-and-Bound Algorithm with Restarts for Solving the Hierarchical Covering Location Problem
Mathematica balkanica, Tome 25 (2011) no. 5, p. 555 Cet article a éte moissonné depuis la source Mathematicac Balkanica website

Voir la notice de l'article

@article{MABA_2011_25_5_a10,
     author = {P. Stanojevic},
     title = {A {Parallel} {\^Aranch-and-Bound} {Algorithm} with {Restarts} for {Solving} the {Hierarchical} {Covering} {Location} {Problem}},
     journal = {Mathematica balkanica},
     pages = {555},
     year = {2011},
     volume = {25},
     number = {5},
     url = {http://geodesic.mathdoc.fr/item/MABA_2011_25_5_a10/}
}
TY  - JOUR
AU  - P. Stanojevic
TI  - A Parallel Âranch-and-Bound Algorithm with Restarts for Solving the Hierarchical Covering Location Problem
JO  - Mathematica balkanica
PY  - 2011
SP  - 555
VL  - 25
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/MABA_2011_25_5_a10/
ID  - MABA_2011_25_5_a10
ER  - 
%0 Journal Article
%A P. Stanojevic
%T A Parallel Âranch-and-Bound Algorithm with Restarts for Solving the Hierarchical Covering Location Problem
%J Mathematica balkanica
%D 2011
%P 555
%V 25
%N 5
%U http://geodesic.mathdoc.fr/item/MABA_2011_25_5_a10/
%F MABA_2011_25_5_a10
P. Stanojevic. A Parallel Âranch-and-Bound Algorithm with Restarts for Solving the Hierarchical Covering Location Problem. Mathematica balkanica, Tome 25 (2011) no. 5, p. 555. http://geodesic.mathdoc.fr/item/MABA_2011_25_5_a10/