Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment-Reference-Cited by-同舟云学术

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

Published:2015-06 Issue:3 Volume:7 Page:719-725
ISSN:2076-7633
Container-title:Computer Research and Modeling
language:
Short-container-title:CRM

Author:

Smirnov S. A.,Voloshinov V. V.

Publisher

Izhevsk Institute of Computer Science

Subject

Computational Theory and Mathematics,Computer Science Applications,Modelling and Simulation

Reference7 articles.

1. Л. Д. Попов. Опыт многоуровневого распараллеливания метода ветвей и границ в задачах дискретной оптимизации // Автоматика и телемеханика. - 2007. - № 5. - С. 171-181.

2. 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.

3. F. Cesarini, S. Thompson. Erlang Programming. - OReilly Media, Inc, 2009.

4. J. Forrest, R. Lougee-Heimer. CBC user guide / INFORMS Tutorials in Operations Research. - 2005. - P. 257-277.

5. R. Fourer, D. M. Gay, B. W. Kernighan. AMPL: A Modeling Language for Mathematical Programming, second edition. - Duxbury Press / Brooks/Cole Publishing Company, 2002.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Implementation and Use of Coarse-grained Parallel Branch-and-bound in Everest Distributed Environment;Procedia Computer Science;2017

2. Implementation of Concurrent Parallelization of Branch-and-bound algorithm in Everest Distributed Environment;Procedia Computer Science;2017