Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Tanaev, V.S. and Shkurba, V.V., Vvedenie v teoriyu raspisanii (Introduction to Scheduling Theory), Yudin, D.B., Ed., Moscow: Nauka, 1975.
Tanaev, V.S., Gordon, V.S., and Shafransky, Ya.M., Teoriya raspisanii. Odnostadiinye sistemy (Scheduling Theory. Single-stage Systems), Moscow: Nauka, 1984.
Tanaev, V.S., Sotskov, Yu.N., and Strusevich, V.A., Teoriya raspisanii. Mnogostadiinye sistemy (Scheduling Theory. Multi-stage Systems), Moscow: Nauka, 1989.
Korbut, A.A. and Finkel’shtein, Yu.Yu., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969.
Emelyanov, S.V., Afanasiev, A.P., Grinberg, Y.R., et al., Distributed Computing and Its Applications, Velikhov, E.P., Ed., Bristol: Felicity, 2005.
Sigal, I.Kh. and Ivanova, A.P., Vvedenie v prikladnoe diskretnoe programmirovanie (Introduction to Applied Discrete Programming), Moscow: Fizmatlit, 2007.
Finkel’shtein, Yu.Yu., Priblizhennye metody i prikladnye zadachi diskretnogo programmirovaniya (Approximate Methods and Applied Problems of Discrete Programming), Moscow: Nauka, 1976.
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.
Martello, S. and Toth, P., Knapsack Problems, New York: Wiley, 1990.
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.
Kellerer, H., Pfershy, U., and Pisinger, D., Knapsack Problems, New York: Springer, 2004.
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.
Yablonskii, S.V., Vvedenie v diskretnuyu matematiku (Introduction to Discrete Mathematics), Moscow: Nauka, 1986.
Kudryavtsev, L.D., Kurs matematicheskogo analiza (A Course of Mathematical Analysis, 2 vols.), Moscow: Vysshaya Shkola, 1981.
Author information
Authors and Affiliations
Additional information
Original Russian Text © R.M. Kolpakov, M.A. Posypkin, I.Kh. Sigal, 2010, published in Avtomatika i Telemekhanika, 2010, No. 10, pp. 156–166.
This work was supported by the Russian Foundation for Basic Research, projects nos. 08-07-00072-a and 09-07-00352-a, and the Analytic departmental program “Developing the Scientific Potential of Higher Education.”
Rights and permissions
About this article
Cite this article
Kolpakov, R.M., Posypkin, M.A. & Sigal, I.K. On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method. Autom Remote Control 71, 2152–2161 (2010). https://doi.org/10.1134/S0005117910100140
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117910100140