<p>Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment</p>

All issues

Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment

pdf (596K) / Annotation

Л. Д. Попов. Опыт многоуровневого распараллеливания метода ветвей и границ в задачах дискретной оптимизации // Автоматика и телемеханика. — 2007. — № 5. — С. 171–181.
M. R. Bussieck, M.C. Ferris, A. Meeraus. Grid Enabled Optimization with GAMS}, INFORMS // Journal on Computing. — 2009. — V. 21, no. 3. — P. 349–362. — MathSciNet: MR2546959.
F. Cesarini, S. Thompson. Erlang Programming. — O’Reilly Media, Inc, 2009.
J. Forrest, R. Lougee-Heimer. CBC user guide / INFORMS Tutorials in Operations Research. — 2005. — P. 257–277.
R. Fourer, D. M. Gay, B. W. Kernighan. AMPL: A Modeling Language for Mathematical Programming, second edition. — Duxbury Press / Brooks/Cole Publishing Company, 2002.
T. Koch, et al. MIPLIB 2010 // Mathematical Programming Computation. — 2011. — V. 3, no. 2. — P. 103–163. — http://plato.asu.edu/ftp/milpc.html. — MathSciNet: MR2811887.
P. Valente, G. Mitra. A grid-aware MIP solver: Implementation and case studies // Future Generation Computer Systems. — 2008. — V. 24, no. 2. — P. 133–141. — DOI: 10.1016/j.future.2007.03.011.

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"