Geodesic
Organization of parallel calculations in some problems of discrete optimization
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 11 (2008) no. 4, pp. 413-422.

Voir la notice de l'article provenant de la source Math-Net.Ru

The organization of parallel calculations with the use of the MPI functions in problems of discrete optimization is considered. The method of branches and borders is applied to problems of the integer linear and the integer quadratic programming, as well as to problems of set covering. The efficiency of algorithms is analyzed on the basis of numerical experiments. 
@article{SJVM_2008_11_4_a5,
     author = {G. I. Zabinyako and E. A. Kotel'nikov},
     title = {Organization of parallel calculations in some problems of discrete optimization},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {413--422},
     publisher = {mathdoc},
     volume = {11},
     number = {4},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2008_11_4_a5/}
}
TY  - JOUR
AU  - G. I. Zabinyako
AU  - E. A. Kotel'nikov
TI  - Organization of parallel calculations in some problems of discrete optimization
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2008
SP  - 413
EP  - 422
VL  - 11
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJVM_2008_11_4_a5/
LA  - ru
ID  - SJVM_2008_11_4_a5
ER  - 
%0 Journal Article
%A G. I. Zabinyako
%A E. A. Kotel'nikov
%T Organization of parallel calculations in some problems of discrete optimization
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2008
%P 413-422
%V 11
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJVM_2008_11_4_a5/
%G ru
%F SJVM_2008_11_4_a5
G. I. Zabinyako; E. A. Kotel'nikov. Organization of parallel calculations in some problems of discrete optimization. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 11 (2008) no. 4, pp. 413-422. http://geodesic.mathdoc.fr/item/SJVM_2008_11_4_a5/

[1] Kovalev M. M., Diskretnaya optimizatsiya (tselochislennoe programmirovanie), Izd-vo Belorusskogo un-ta, Minsk, 1977 | MR | Zbl

[2] Murtaf B., Sovremennoe lineinoe programmirovanie: Teoriya i praktika, Mir, M., 1984 | MR

[3] Pissanetski S., Tekhnologiya razrezhennykh matrits, Mir, M., 1988 | MR

[4] Timoshevskaya N. E., “Parallelnye metody obkhoda dereva”, Matem. modelirovanie, 16:1 (2004), 105–114 | MR | Zbl

[5] Van Nieuwpoort R. V., Kielmann T., and Bal H. E., “Efficient load balancing for wide-area divide-and-conquer applications”, Proc. PPoPP'01: ACM SIGPLAN, 2001, 34–43

[6] Toporkov V. V., Problemy raspredelennykh vychislenii, Fizmatlit, M., 2004 | Zbl

[7] Mittelman H. D., Decision Tree for Optimization Software, http://plato.asu.edu/guide.html/

[8] Caprara A., Toht P., and Fischetti M., “Algorithms for the set covering problem”, Annals of Operations Research, 98 (2000), 353–371 | DOI | MR | Zbl

[9] Fisher M. L., Kedia P., “Optimal solution of set covering/partitioning problems using dual heuristics”, Management Sci., 36 (1990), 674–688 | DOI | MR | Zbl

[10] Beasley J. E., “OR-Library: distributing test problems by electronic mail”, J. of the Operational Research Society, 41:11 (1990), 1069–1072