Skip to main content
Springer Nature Link
Log in

Parallel best-first branch- and-bound in discrete optimization: A framework

  • Chapter
  • First Online:
Solving Combinatorial Optimization Problems in Parallel

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1054))

  • 253 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Abdelrahman and T. Mudge. Parallel branch and bound algorithms on hypercube multiprocessors. In 1988 ACM Conf. on Lisp and Funct. Prog., pages 1492–1499. ACM Press, 1988.

    Google Scholar 

  2. G. Ananth, V. Kumar, and P. Pardalos. Parallel processing of discrete optimization problems. Encyclopedia of Microcomputers, 13:129–147, 1993.

    Google Scholar 

  3. S. Arvindam, V. Kumar, and V. N. Rao. Efficient parallel algorithms for search problems: Applications in VLSI CAD. In Proceedings of the Frontiers 90 Conference on Massively Parallel Computation, October 1990.

    Google Scholar 

  4. A. Barr and E. Feigenbaum. The Handbook of Artificial Intelligence, volume I. William Kaufmann, Inc., 1981.

    Google Scholar 

  5. R. Boehning, R. Butler, and B. Gillett. A parallel integer LP algorithm. European Journal of Operations Reasearch, 34:393–398, 1988.

    Article  Google Scholar 

  6. J. Clausen. Do inherently sequential branch-and-bound algorithms exist? Parallel Processing Letters. To appear.

    Google Scholar 

  7. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, McGraw-Hill, 1990.

    Google Scholar 

  8. R. Corrêa and A. Ferreira. Modeling parallel branch-and-bound for asynchronous implementations. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 22:45–55, 1995.

    Google Scholar 

  9. R. Corrêa and A. Ferreira. A distributed implementation of asynchronous parallel branch-and-bound. In A. Ferreira and J. Rolim, editors, Solving Irregular Problems in Parallel: State of the Art pages 157–176. Kluwer Academic Publisher, Boston (USA), 1995.

    Google Scholar 

  10. R. Corrêa and A. Ferreira. On the effectiveness of synchronous branch-and-bound algorithms. Parallel Processing Letters, 1995. To appear.

    Google Scholar 

  11. J. Eckstein. Control strategies for parallel mixed integer branch and bound. In I. C. S. Press, editor, Supercomputing '94, 1994.

    Google Scholar 

  12. J. Eckstein. Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5. SIAM Journal on Optimization, 4(4):794–814, Nov. 1994.

    Article  Google Scholar 

  13. A. Ferreira and J. Rolim, editors. Solving Irregular Problems in Parallel: State of the Art. Kluwer Academic Publisher, Boston (USA), 1995.

    Google Scholar 

  14. R. Finkel and U. Manber. DIB — A distributed implementation of backtracking. ACM Transactions on Programming Languages and Systems, 9(2):235–256, Apr. 1987.

    Article  Google Scholar 

  15. B. Fox, J. Lenstra, A. Rinnooy Kan, and L. Schrage. Branching from the largest upper bound: folklore and facts. Europ. Journal of Op. Res., pages 191–194, 1978.

    Google Scholar 

  16. M. Gengler. Axiomatique de branch and bound. Rapport interne 77, LITH — Ecole Polytechnique Fédérale de Lausanne, 1992.

    Google Scholar 

  17. M. Gengler and G. Coray. A parallel best-first B&B with synchronization phases. In L. Bougé, M. Cosnard, Y. Robert, and D. Trystram, editors, Parallel Processing: CONPAR 92 — VAPP V, LNCS 634, pages 515–526. Springer-Verlag, Sept. 1992.

    Google Scholar 

  18. S. Gnesi, U. Montanari, and A. Martelli. Dynamic programming as graph searching: An algebraic approach. Journal of the ACM, 28(4):737–751, Oct. 81.

    Google Scholar 

  19. E. Horowitz and A. Zorat. Divide-and-conquer for parallel processing. IEEE Transactions on Computers, c-32(6):582–585, June 1983.

    Google Scholar 

  20. T. Ibaraki. Theoretical comparisons of search strategies in branch-and-bound algorithms. Int. Journal of Computing and Information Sc., 5(4):315–344, 1976.

    Article  Google Scholar 

  21. T. Ibaraki. The power of dominance relations in branch-and-bound algorithms. Journal of the ACM, 24(2):264–279, Apr. 1977.

    Article  Google Scholar 

  22. T. Ibaraki. Branch-and-bound procedure and the state-space representation of combinatorial optimization problems. Inf. and Control, 36:1–27, 1978.

    Article  Google Scholar 

  23. R. Karp and Y. Zhang. A randomized parallel branch-and-bound procedure. In Symposium on Theory of Computing, pages 290–300, 1988.

    Google Scholar 

  24. R. Karp and Y. Zhang. Randomized parallel algorithms for backtrack search and branch-and-bound computations. Journal of the ACM, 40(3):765–789, July 1993.

    Article  Google Scholar 

  25. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms. The Benjamin/Cummings Publishing Company, Inc., 1994.

    Google Scholar 

  26. V. Kumar and L. Kanal. The CDP: a unifying formulation for heuristic search, dynamic programming, and branch-and-bound. In National Conf. on A.I., 1983.

    Google Scholar 

  27. V. Kumar, K. Ramesh, and V. N. Rao. Parallel best-first search of state-space graphs: A summary of results. In Proceedings of the 1988 National Conf. on Artificial Intelligence, pages 122–127, Aug. 1988.

    Google Scholar 

  28. T. Lai and S. Sahni. Anomalies in parallel branch-and-bound algorithms. Communications of the ACM, 27:594–602, 1984.

    Article  Google Scholar 

  29. T. Lai and A. Sprague. Performance of parallel branch-and-bound algorithms. IEEE Transactions on Computers, C-34(10):962–964, Oct. 1985.

    Google Scholar 

  30. T. Lai and A. Sprague. A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions. Information Processing Letters, 23:119–122, 1986.

    Article  MathSciNet  Google Scholar 

  31. P. S. Laursen. Simple approaches to parallel Branch and Bound. Paral. Comp., 19:143–152, 1993.

    Article  Google Scholar 

  32. W. Levelt, M. Kaashoek, H. Bal, and A. Tanenbaum. A comparision of two paradigms for distributed shared memory. Software — Practice and Experience, 22(11):985–1010, Nov. 1992.

    Google Scholar 

  33. G. Li and B. Wah. Coping with anomalies in parallel branch-and-bound algorithms. IEEE Transactions on Computers, C-35(6):568–573, June 1986.

    Google Scholar 

  34. Y. Li and P. Pardalos. Parallel algorithms for the quadratic assignment problem. In P. Pardalos, editor, Advances in Optimization and Parallel Computing, pages 177–189. North-Holland, 1992.

    Google Scholar 

  35. J. Little, K. Murty, D. Sweeney, and C. Karel. An algorithm for the traveling salesman problem. Operations Research, 11:972–989, 1963.

    Google Scholar 

  36. R. Lüling and B. Monien. Load balancing for distributed branch & bound algorithms. In International Parallel Processing Symposium, pages 543–549, Beverly Hills, CA, 1992.

    Google Scholar 

  37. R. Lüling and B. Monien. Load balancing for distributed branch & bound algorithms. Technical Report Nr. 114, Universität Gesamthochschule Paderborn, Feb. 1993.

    Google Scholar 

  38. R. Ma, F. Tsung, and M. Ma. A dynamic load balancer for a parallel branch and bound algorithm. In 1988 ACM Conf. on Lisp and Funct. Prog., pages 1505–1513. ACM Press, 1988.

    Google Scholar 

  39. B. Mans. Contribution à l'Algorithmique Non Numérique Parallèle: Parallélisation de Méthodes de Recherche Arborescente. PhD thesis, Université Paris VI, June 1992.

    Google Scholar 

  40. D. Miller and J. Pekny. Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. Operations Research Letters, 8:129–135, June 1989.

    Article  Google Scholar 

  41. L. Mitten. Branch-and-bound methods: General formulation and properties. Operations Research, 18:24–34, 1970. Errata in Operations Research 19 (1971), 550.

    Google Scholar 

  42. T. Morin and R. Marsten. Branch-and-bound strategies for dynamic programming. Operations Research, 24(4):611–627, Aug. 1976.

    Google Scholar 

  43. D. Nau, V. Kumar, and L. Kanal. General branch and bound, and its relation to A* and AO*. Artificial Intelligence, (23):29–58, 1984.

    Article  Google Scholar 

  44. G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization. John Wiley and Sons Interscience, 1988.

    Google Scholar 

  45. C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall Inc., Englewood Cliffs, NJ, 1982.

    Google Scholar 

  46. P. Pardalos and J. Crouse. A parallel algorithm for the quadratic assignment problem. In Proceedings Supercomputing 1989, pages 351–360. ACM Press, 1989.

    Google Scholar 

  47. P. Pardalos and X. Li. Parallel branch-and-bound algorithms for combinatorial optimization. Supercomputer, pages 23–30, Sept. 1990.

    Google Scholar 

  48. J. Pearl. Heuristics — Intelligent Search Strategies for Computer Problem Solving. Reading, MA: Addison-Wesley, 1984.

    Google Scholar 

  49. J. Pekny and D. Miller. A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. Mathematical Programming, 55:17–33, 1992.

    Article  Google Scholar 

  50. E. Pruul, G. Nemhauser, and R. Rushmeier. Branch-and-bound and parallel computation: a historical note. Op. Res. Letters, 7(2):65–69, Apr. 1988.

    Article  Google Scholar 

  51. M. Quinn. Analysis and Implementation of Branch and Bound Algorithms on a Hypercube Multicomputer. IEEE Trans. on Comp., 39(3):384–387, March 1990.

    Article  Google Scholar 

  52. M. Quinn and N. Deo. An upper bound for the speedup of parallel best-first branch-and-bound algorithms. BIT, (26):35–43, 1986.

    Article  Google Scholar 

  53. C. Roucairol. A parallel branch and bound algorithm for the quadratic assignment problem. Discrete Applied Mathematics, 18, 1987.

    Google Scholar 

  54. K. Schawan, J. Gawkowski, and B. Blake. Process and workload migration for a parallel branch-and-bound algorithm on a hypercube multicomputer. In 1988 ACM Conf. on Lisp and Funct. Prog., pages 1520–1530. ACM Press, 1988.

    Google Scholar 

  55. D. R. Smith. Random trees and the analysis of branch and bound. Journal of the ACM, 31(1):163–188, 1984.

    Article  Google Scholar 

  56. H. Trienekens. Parallel Branch and Bound Algorithms. PhD thesis, Erasmus University, Rotterdam, 1990.

    Google Scholar 

  57. B. Wah and Y. Eva. MANIP — A multicomputer architecture for solving combinatorial extremum-search problems. IEEE Transactions on Computers, C-33(5):377–390, May 1984.

    Google Scholar 

  58. B. Wah and C. Yu. Stochastic modeling of branch-and-bound algorithms with best-first search. IEEE Transactions on Software Engineering, SE-11(0):922–934, Sept. 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LMC-IMAG, 46, av. Félix Viallet, 38031, Grenoble Cedex, France

    Ricardo Corrêa

  2. CNRS-LIP-ENS-Lyon, 46, allée d'Italie, 69364, Lyon Cedex 07, France

    Afonso Ferreira

Authors
  1. Ricardo Corrêa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Afonso Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Afonso Ferreira Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Corrêa, R., Ferreira, A. (1996). Parallel best-first branch- and-bound in discrete optimization: A framework. In: Ferreira, A., Pardalos, P. (eds) Solving Combinatorial Optimization Problems in Parallel. Lecture Notes in Computer Science, vol 1054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027122

Download citation

  • DOI: https://doi.org/10.1007/BFb0027122

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61043-4

  • Online ISBN: 978-3-540-49875-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics