Automation and Remote Control

, Volume 68, Issue 5, pp 901–911 | Cite as

Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems

  • L. D. Popov
Topical Issue


Various schemes are considered of the parallel implementation of the branch and bound method, as applied to multiprocessor computing systems (clusters) with the distributed memory. In the language of informal automata, questions are set out of the organization of the exchange of data and signals within the cluster, which afford the asynchronous operation of its processors. Common ideas are illustrated by the example of the classical traveling salesman problem and data of numerical experiments performed on the multiprocessor computing system-100 (MCS-100) are given.

PACS number



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Korbut, A.A. and Finkel’shtein, Yu.Yu., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969.Google Scholar
  2. 2.
    Emelichev, V.A., Kovalev, M.M., and Kravtsov, M.K., Mnogogranniki, grafy, optimizatsiya (Polyhedrons, Graphs, and Optimization), Moscow: Nauka, 1981.zbMATHGoogle Scholar
  3. 3.
    Sergienko, I.V., Matematicheskie modeli i metody resheniya zadach diskretnoi optimizatsii (Mathematical Models and Methods of Solution of Discrete Optimization Problems), Kiev: Naukova Dumka, 1988.Google Scholar
  4. 4.
    Ananth, G.Y., Kumar, V., and Pardalos, P., Parallel Processing of Discrete Optimization Problems, Encyclopedia Microcomput., 1993, vol. 13, pp. 129–147.Google Scholar
  5. 5.
    Gendron, B. and Grainic, T.G., Parallel Branch-And-Bound Survey and Synthesis, Oper. Res., 1994, vol. 42, no. 2, pp. 1042–1066.zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Verkhoturov, V.R., Veselovskii, V.E., Zlotov, A.V., et al., Kombinatornye metody i algoritmy resheniya zadach diskretnoi optimizatsii bol’shoi razmernosti (Combinatorial Methods and Algorithms of Solution of Discrete Optimization Problems of Large Dimensions), Moscow: Nauka, 2000.Google Scholar
  7. 7.
    Voevodin, V.V., Parallel’nye vychisleniya (Parallel Computations), St. Petersburg: BKhV-Peterburg, 2004.Google Scholar
  8. 8.
    Chetverushkin, B.N., Highly Productive Multiprocessor Computing Systems, Vest. Ross. Akad. Nauk, 2002, vol. 72, no. 9, pp. 786–794.Google Scholar
  9. 9.
    Prisypkin, M.A., Sigal, I.Kh., and Galim’yanova, N.N., Parallel’nye algoritmy v zadachakh diskretnoi optimizatsii: vychislitel’nye modeli, biblioteki, rezul’taty eksperimentov (Parallel Algorithms in Discrete Optimization Problems: Computational Models, Library, Results of Experiments), Moscow: Vychisl. Tsentr Akad. Nauk SSSR, 2006.Google Scholar
  10. 10.
    Popov, L.D., On Parallel Implementation of the Branch and Bound Method for the Traveling Salesman Problem, in Algorithms and Software of Parallel Computations, Ekaterinburg: Ross. Akad. Nauk, 1998, issue 2, pp. 236–255.Google Scholar
  11. 11.
    Trienekes, H.W.J.M., Parallel Branch and Bound on an MIMD System, Rotterdam: Econometric Institute, Erasmus University, Report 8640/A.Google Scholar
  12. 12.
    Little, J., Murty, K., Sweeney, D., and Karel, C., An Algorithm for Traveling Salesman Problem, Oper. Res., 1963, vol. 11, no. 6, pp. 972–990.zbMATHGoogle Scholar
  13. 13.
    The Travelling Salesman Problem, Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.N., and Shmoys, D.B., Eds., New York: Wiley, 1985.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2007

Authors and Affiliations

  • L. D. Popov
    • 1
  1. 1.Institute of Mathematics and Mechanics, Ural BranchRussian Academy of SciencesYekaterinburgRussia

Personalised recommendations