Automation and Remote Control

, Volume 71, Issue 10, pp 2152–2161 | Cite as

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

  • R. M. Kolpakov
  • M. A. Posypkin
  • I. Kh. Sigal
Parallel and Distributed Systems


We study parallel complexity of the branch-and-bound method for optimization problems. We consider a standard implementation scheme for the branch-and-bound method on a parallel system, in which first only one processor is working, and then the resulting subtasks are given out to other processors. For this scheme, we give a lower bound on the parallel complexity independent of the problem. We study the complexity of this scheme for the Boolean knapsack problem. For a classical algorithmically hard example, we obtain parallel complexity bounds and show that these bounds coincide in order with each other and with the common lower bound on parallel complexity. Thus, we show that the common lower bound is achieved, in the order, for some optimization problems.


Remote Control Knapsack Problem Discrete Optimization Problem Elimination Rule Parallel Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Tanaev, V.S. and Shkurba, V.V., Vvedenie v teoriyu raspisanii (Introduction to Scheduling Theory), Yudin, D.B., Ed., Moscow: Nauka, 1975.Google Scholar
  2. 2.
    Tanaev, V.S., Gordon, V.S., and Shafransky, Ya.M., Teoriya raspisanii. Odnostadiinye sistemy (Scheduling Theory. Single-stage Systems), Moscow: Nauka, 1984.Google Scholar
  3. 3.
    Tanaev, V.S., Sotskov, Yu.N., and Strusevich, V.A., Teoriya raspisanii. Mnogostadiinye sistemy (Scheduling Theory. Multi-stage Systems), Moscow: Nauka, 1989.Google Scholar
  4. 4.
    Korbut, A.A. and Finkel’shtein, Yu.Yu., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969.Google Scholar
  5. 5.
    Emelyanov, S.V., Afanasiev, A.P., Grinberg, Y.R., et al., Distributed Computing and Its Applications, Velikhov, E.P., Ed., Bristol: Felicity, 2005.Google Scholar
  6. 6.
    Sigal, I.Kh. and Ivanova, A.P., Vvedenie v prikladnoe diskretnoe programmirovanie (Introduction to Applied Discrete Programming), Moscow: Fizmatlit, 2007.Google Scholar
  7. 7.
    Finkel’shtein, Yu.Yu., Priblizhennye metody i prikladnye zadachi diskretnogo programmirovaniya (Approximate Methods and Applied Problems of Discrete Programming), Moscow: Nauka, 1976.Google Scholar
  8. 8.
    Posypkin, M.A. and Sigal, I.Kh., Speedup Estimates for Some Variants of the Parallel Implementations of the Branch-and-bound Method, Zh. Vychisl. Mat. Mat. Fiz., 2006, vol 46, no. 12, pp. 2289–2304.MathSciNetGoogle Scholar
  9. 9.
    Martello, S. and Toth, P., Knapsack Problems, New York: Wiley, 1990.zbMATHGoogle Scholar
  10. 10.
    Kolpakov, R.M. and Posypkin, M.A., Upper and Lower Bounds for the Complexity of the Branch-andbound Method for the Knapsack Problem, Tr. Inst. Sist. Anal., 2008, vol. 32, pp. 137–158.Google Scholar
  11. 11.
    Kellerer, H., Pfershy, U., and Pisinger, D., Knapsack Problems, New York: Springer, 2004.zbMATHGoogle Scholar
  12. 12.
    Kolpakov, R.M. and Posypkin, M.A., An Asymptotic Bound on the Complexity of the Branch-andbound Method with Branching by the Fractional Variable in the Knapsack Problem, Diskret. Anal. Issled. Oper., 2008, vol. 15, no. 1, pp. 58–81.MathSciNetGoogle Scholar
  13. 13.
    Yablonskii, S.V., Vvedenie v diskretnuyu matematiku (Introduction to Discrete Mathematics), Moscow: Nauka, 1986.Google Scholar
  14. 14.
    Kudryavtsev, L.D., Kurs matematicheskogo analiza (A Course of Mathematical Analysis, 2 vols.), Moscow: Vysshaya Shkola, 1981.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2010

Authors and Affiliations

  • R. M. Kolpakov
    • 1
  • M. A. Posypkin
    • 2
  • I. Kh. Sigal
    • 3
  1. 1.Moscow State UniversityMoscowRussia
  2. 2.Institute for Systems AnalysisRussian Academy of SciencesMoscowRussia
  3. 3.Computer CentreRussian Academy of SciencesMoscowRussia

Personalised recommendations