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.
Supported by JSPS Research Fellowships for Young Scientists.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
B.Gendron and T.G.Crainic. Parallel Branch-and-Bound Algorithms: Survey and Synthesis. Operations Research, 42(6):1042–1066, 1994.
T.Ibaraki. The Power of Dominance Relations in Branch-and-Bound Algorithms. Journal of the ACM, 24(2):264–279, 1977.
T.Ibaraki. Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems. Information and Control, 36:1–27, 1978.
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.
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.
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.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shinano, Y., Higaki, M., Hirabayashi, R. (1996). An interface design for general parallel branch-and-bound algorithms. In: Ferreira, A., Rolim, J., Saad, Y., Yang, T. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1996. Lecture Notes in Computer Science, vol 1117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030117
Download citation
DOI: https://doi.org/10.1007/BFb0030117
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61549-1
Online ISBN: 978-3-540-68808-2
eBook Packages: Springer Book Archive