Geodesic
Parallel calculations in some problems of discrete optimization
Matematičeskoe modelirovanie, Tome 21 (2009) no. 9, pp. 99-107.

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

A parallel realization of the branch-and-bound method in problems of discrete optimization is considered. The productivity of paralleling is analyzed on the basis of experimental calculations for problems of integer linear and integer quadratic programming and set covering problems. 
@article{MM_2009_21_9_a9,
     author = {G. I. Zabinyako and E. A. Kotel'nikov},
     title = {Parallel calculations in some problems of discrete optimization},
     journal = {Matemati\v{c}eskoe modelirovanie},
     pages = {99--107},
     publisher = {mathdoc},
     volume = {21},
     number = {9},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MM_2009_21_9_a9/}
}
TY  - JOUR
AU  - G. I. Zabinyako
AU  - E. A. Kotel'nikov
TI  - Parallel calculations in some problems of discrete optimization
JO  - Matematičeskoe modelirovanie
PY  - 2009
SP  - 99
EP  - 107
VL  - 21
IS  - 9
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MM_2009_21_9_a9/
LA  - ru
ID  - MM_2009_21_9_a9
ER  - 
%0 Journal Article
%A G. I. Zabinyako
%A E. A. Kotel'nikov
%T Parallel calculations in some problems of discrete optimization
%J Matematičeskoe modelirovanie
%D 2009
%P 99-107
%V 21
%N 9
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MM_2009_21_9_a9/
%G ru
%F MM_2009_21_9_a9
G. I. Zabinyako; E. A. Kotel'nikov. Parallel calculations in some problems of discrete optimization. Matematičeskoe modelirovanie, Tome 21 (2009) no. 9, pp. 99-107. http://geodesic.mathdoc.fr/item/MM_2009_21_9_a9/

[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:4 (2004), 105–114 | MR | Zbl

[5] Nieuwpoort R. V., Kielmann T., Bal H. E., “Effecient load balancing for wide-area divide-and-conquar applications”, Proc. PPOPP' 01, 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., 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”, European J. Oper. Res. Soc., 41 (1990), 1069–1072 | DOI