Advertisement

An interface design for general parallel branch-and-bound algorithms

  • Yuji Shinano
  • Masahiro Higaki
  • Ryuichi Hirabayashi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1117)

Abstract

Branch-and-Bound algorithms are general methods applicable to various combinatorial optimization problems. There are two hopeful methods to improve the algorithms. One is development of the algorithms which exploit the structure of each problem. The other is parallelization of the algorithms. These two methods have been studied by different research communities independently. If a well-designed interface separating the two kinds of implementation of the methods clearly could be constructed, it would enable us to adapt latest algorithms or technology easily. In this paper, we propose a small and simple interface design of a generalized system for parallel branch-and-bound algorithms.

Key words

parallel processing combinatorial optimization problem branch-and-bound algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R.Corrêa. A Parallel Formulation for General Branch-and-Bound Algorithms. Parallel Algorithms for Irregularly Structured Problems, A.Ferreira and J.Rolim(eds.), LNCS 980, 395–409, Springer, 1995.Google Scholar
  2. 2.
    B.Gendron and T.G.Crainic. Parallel Branch-and-Bound Algorithms: Survey and Synthesis. Operations Research, 42(6):1042–1066, 1994.MathSciNetGoogle Scholar
  3. 3.
    T.Ibaraki. The Power of Dominance Relations in Branch-and-Bound Algorithms. Journal of the ACM, 24(2):264–279, 1977.CrossRefGoogle Scholar
  4. 4.
    T.Ibaraki. Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems. Information and Control, 36:1–27, 1978.CrossRefGoogle Scholar
  5. 5.
    V.Kumar and L.N.Kanal. A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures. Artificial Intelligence, 21:179–198, 1983.Google Scholar
  6. 6.
    G.P.McKeown, V.J.Rayward-Smith and H.J.Turpin. Branch-and-Bound as a Higher-Order Function. Annals of Operations Research, 33:379–402, 1991.CrossRefGoogle Scholar
  7. 7.
    G.P.McKeown, V.J.Rayward-Smith and S.A.Rush. Parallel Branch-and-Bound. Advances in Parallel Algorithms, L.Kronsjö and D.Shumsheruddin(eds.), Advanced topics in computer science, 111–150, Blackwell, 1992.Google Scholar
  8. 8.
    D.S.Nau, V.Kumar and L.Kanal. General Branch and Bound, and Its Relation to A* and AO *. Artificial Intelligence, 23:29–58, 1984.CrossRefGoogle Scholar
  9. 9.
    Y.Shinano, M.Higaki and R.Hirabayashi. A Genearlized Utility for Parallel Branch and Bound Algorithms. Proc. of the 7th IEEE Symposium on Parallel and Distributed Processing, 392–401, IEEE Computer Society Press, 1995.Google Scholar
  10. 10.
    S.Tchöke, R.Lüling and B.Monien. Solving the Traveling Salesman Problem with a Distributed Branch-and-Bound Algorithm on a 1024 Processor Network. Proc. of the 9th International Parallel Processing Symposium, Santa Barbara, CA, April 1995. To appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Yuji Shinano
    • 1
  • Masahiro Higaki
    • 1
  • Ryuichi Hirabayashi
    • 1
  1. 1.Science University of TokyoTokyoJapan

Personalised recommendations