Skip to main content
SpringerLink
Log in

Building a parallel branch and bound library

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

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

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. J. Bitwas and J. Browne. Simultaneous update of priority structures. IEEE international conference on parallel computing, pages 124–131, 1987.

    Google Scholar 

  2. R. Bœhning, R. Butler, and B. Gillett. A parallel integer linear programming algorithm. (34):393–398, 1988.

    Google Scholar 

  3. M. Brown. Implementation and analysis of binomial queue algorithmms. SIAM Comput., 7:298–319, 1978.

    Article  Google Scholar 

  4. F. Burton, G. Mc Keown, V. Rayward-Smith, and M. Sleep. Parallel processing and combinatorial optimization. In L. Wilson, C. Edwards, and V. Rayward-Smith, editors, Combinatorial Optimization III, pages 19–36. University of Stirling, U.K., 1982.

    Google Scholar 

  5. J. Calhoun and R. Ford. Concurrency control mechanisms and the serializability of concurrent tree algorithms. In of the 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Waterloo Ontario, Apr. 1984.

    Google Scholar 

  6. T. Cannon and K. Hoffman. Large-scale 0–1 linear programming on distributed workstations. Annals of Opns Res., 22:181–217, 1990.

    Article  Google Scholar 

  7. V.-D. Cung. Contribution à l'Algorithmique Non Numérique Parallèle: Exploration d'Espaces de Recherche. PhD thesis, Université Pierre et Marie Curie-Paris VI, 4, Place Jussieu, 75252 Paris Cedex 05, FRANCE, Apr. 1994. In French.

    Google Scholar 

  8. V.-D. Cung and B. Le Cun. An efficient implementation of parallel a*. In Lecture Notes in Computer Science, Parallel and Distributed computing: Theory and Practice, Canada-France Conference on Parallel Computing, number 805, pages 153–168, May 1994.

    Google Scholar 

  9. V.-D. Cung and C. Roucairol. Parcours parallèle d'arbres minimax. RR 1549, INRIA, Nov. 1991. In French.

    Google Scholar 

  10. S. Das and W.-B. Horng. Managing a parallel heap efficiently. In Proc. PARLE'91-Parallel Architectures and Languages Europe, pages 270–288, 1991.

    Google Scholar 

  11. N. Deo. Data structures for parallel computation on shared-memory machine. In SuperComputing, pages 341–345, 1989.

    Google Scholar 

  12. N. Deo. Data structures for parallel computation on shared memory machines. In J. Kowalik, editor, Supercomputing 89, volume F62 of NATO ASI, pages 341–345. Springer-Verlag, 1990.

    Google Scholar 

  13. N. Deo and S. Prasad. Parallel heap: An optimal parallel priority queue. Journal of Supercomputing, 6(1):87–98, Mar. 1992.

    Article  Google Scholar 

  14. O. E. Dessouki and W. Huen. Distributed enumeration on networks computers. IEEE Tans. on Comp., (29):818–825, 1980.

    Google Scholar 

  15. M. Diamond, C. Kimbel, and S. R. C.L. Rennolet. Pico: Parallel implementation of combinatorial optimization. In Workshop on Parallel Computing of Discrete Optimization Problems. University Minneapolis — AHPC, 1991.

    Google Scholar 

  16. S. Dowaji and C. Roucairol. Priority of tasks and performances of branch-and-bound load balancing strategies. In First european Parallel Virtual Machine (PVM) users group meeting, Euro-Pvm'94, Rome, Italie, 9–11 Oct. 1994. University of Roma.

    Google Scholar 

  17. J. Eckstein. Parallel branch-and-bound algorithms for general mixed integer programming. TMC 257, Thinking Machine Corporation, 1993.

    Google Scholar 

  18. C. Ellis. Concurrent search and insertion in 2–3 trees. Acta Informatica, 14:63–86, 1980.

    Article  Google Scholar 

  19. C. Ellis. Concurrent search and insertion in avl trees. IEEE Trans. on Cumputers, C-29(9):811–817, Sept. 1981.

    Google Scholar 

  20. R. Finkel and U. Manber. Dib-a distributed implementation of backtracking. ACM Trans. Programming Lang. Syst., (9):235–256, 1987.

    Article  Google Scholar 

  21. M. Fredman, R. Sedgewick, D. Sleator, and R. Tarjan. The pairing heap: A new form of self-adjusting heap. Algorithmica, 1:111–129, 1986.

    Article  Google Scholar 

  22. M. Gengler and G. Coray. A parallel best first b&b with synchronization phases. In L. Bougé et al., editor, Proceedings of CONPAR92, pages 515–526. Springer-Verlag, 1992.

    Google Scholar 

  23. Q. Huang. An evaluation of concurrent priority queue algorithms. In Third IEEE Symposium on Parallel and Distributed Processing, pages 518–525, Dec. 1991.

    Google Scholar 

  24. D. Jones. An empirical comparaison of priority queue and event set implementation. Comm. ACM, 29(320):191–194, Apr. 1986.

    Article  Google Scholar 

  25. D. Jones. Concurrent operations on priority queues. ACM, 32(1):132–137, Jan. 1989.

    Article  MathSciNet  Google Scholar 

  26. L. Kalé and V. A. Saletore. Parallel state-space search for a first solution with consistent linear speedups. International Journal of Parallel Programming, 19(4):251–293, 1990.

    Article  Google Scholar 

  27. D. Knuth. The Art of Programming: Sorting and Searching, volume 3. Addison-Wesley, 1973.

    Google Scholar 

  28. G. Kudva and J. Pekny. Dcabb: A distributed control architecture for b&b computations. In ORSA/TIMS Conference, Phœnix, 1993.

    Google Scholar 

  29. V. Kumar and A. Gupta. Analyzing the scability of parallel algorithms and architectures. In International Conference on Supercomputing, 1991.

    Google Scholar 

  30. H. Kung and P. Lehman. Concurrent manipulation of binary search trees. ACM trans. on Database Systems, 5(3):354–382, 1980.

    Article  Google Scholar 

  31. T. Lai and S. Sahni. Anomalies in parallel branch and bound algorithms. Communication ACM, (27):594–602.

    Google Scholar 

  32. I. Lavallée and C. Roucairol. A parallel b&b algorithm. Technical Report 164, LRI — Université d'Orsay, 1984.

    Google Scholar 

  33. B. Le Cun, B. Mans, and C. Roucairol. Opérations concurrentes et files de priorité. RR 1548, INRIA-Rocquencourt, 1991.

    Google Scholar 

  34. B. Le Cun, B. Mans, and C. Roucairol. Comparison of concurrent priority queues for branch and bound algorithms. RR 92-65, MASI Universite Pierre et Marie Curie, 1992.

    Google Scholar 

  35. B. Le Cun, C. Roucairol, and the PNN team. Bob: a unified platform for implementing branch-and-bound like algorithms. RR 95/16, Laboratoire PRiSM, Université de Versailles-Saint Quentin en Yvelines, Sept. 1995.

    Google Scholar 

  36. P. Lehman and S. Yao. Efficient locking for concurrent operation on b-tree. ACM trans. on Database Systems, 6(4):650–670, Dec. 1981.

    Article  Google Scholar 

  37. G. Li and B. Wah. Computational efficiency of parallel approximate branch and bound algorithms. In International Conference on Parallel Processing, pages 473–480, 1984.

    Google Scholar 

  38. R. Luling and B. Monien. Two strategies for solving the vertex cover problem on a transputer network. In Lecture Notes in Computer Science, number 392, pages 160–170. Springer Verlag, 1989.

    Google Scholar 

  39. B. Mans, T. Mautor, and C. Roucairol. A parallel depth first search branch and bound algorithm for the quadratic assignment problem. EJOR European Journal of Operational Research, 81(3):617–628, 1995.

    Article  Google Scholar 

  40. B. Mans and C. Roucairol. Concurrency in priority queues for branch and bound algorithms. Technical Report 1311, INRIA, 1990.

    Google Scholar 

  41. B. Mans and C. Roucairol. Characterization of data structures for parallel branch and bound algorithms. In European Congress of Operation Research, EURO'XI, Aachen, Germany, 1991.

    Google Scholar 

  42. B. Mans and C. Roucairol. Performances of parallel branch-and-bound algorithms with best first search. In I. Lavallée and Y. Paker, editors, OPOPAC International Workshop on Principles of Parallel Computing, pages 121–139. Hermès, 1993.

    Google Scholar 

  43. T. Mautor. Contribution à la résolution des problèmes d'implantation: algorithmes séquentiels et parallèles pour l'affectation quadratique. Thèse d'université, Université Paris VI, 4, place Jussieu, 75252 Paris Cedex 05, Feb. 1993.

    Google Scholar 

  44. T. Mautor and C. Roucairol. Difficulties of exact methods for solving the quadratic assignment problem. In P. M. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems, volume 16 of Discrete Mathematics and Theoretical Computer Science, pages 263–274. DIMACS, American Mathematical Society, May 1994.

    Google Scholar 

  45. T. Mautor and C. Roucairol. A new exact algorithm for the solution of quadratic assignment problems. Discrete Applied Mathematics, (55):281–293, 1994.

    Article  Google Scholar 

  46. E. M. McCreight. Priority search trees. SIAM J Computing, 14(2):257–276, May 1985.

    Article  Google Scholar 

  47. G. McKeown, V. Rayward-Smith, and H. Turpin. Branch and bound as a higher order function. In Annals of Operations Research, volume 33, pages 379–402. 1991.

    Article  Google Scholar 

  48. P. Pardalos and G. Rodgers. In Impact of Recent Computer Advances on Operational Research, chapter Parallel Branch-and-Bound Algorithms for Unconstrained Quadratic Zero-one Programming. Elsevier Sc., 1989.

    Google Scholar 

  49. R. Pargas and E. Wooster. Branch-and-bound algorithms on a hypercube. In Conference on Hypercube Concurrent computers and applications, volume II, pages 1514–1519, 1988.

    Article  Google Scholar 

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

    Article  Google Scholar 

  51. E. Pruul. Parallel processing and a branch and bound algorithm. Master's thesis, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, N.Y., 1975.

    Google Scholar 

  52. M. Quinn. Implementing best first branch and bound algorithm on hypercube multicomputers. In M. Health, editor, Hypercube Multiprocessors, pages 318–326. SIAM Press, 1987.

    Google Scholar 

  53. S. K. R. Burkard and F. Rendl. Qaplib — a quadratic assignment problem library. European Journal of Operational Research, (55):115–119, 1991 (Updated version — Feb. 1994).

    Article  Google Scholar 

  54. V. Rao and V. Kumar. Concurrent insertions and deletions in a priority queue. IEEE proceedings of International Conference on Parallel Processing, pages 207–211, 1988.

    Google Scholar 

  55. C. Roucairol. In Parallel and Distributed Algorithms, chapter Parallel Branch and Bound Algorithms: an Overview, pages 153–163. Elsevier Science Publishers, North-Holland, 1988.

    Google Scholar 

  56. C. Roucairol. Parallel computing in combinatorial optimization. Computer Physics Reports, 11:195–220, 1989.

    Article  Google Scholar 

  57. C. Roucairol. Recherche arborescente en parallèle. RR M.A.S.I. 90.4, Institut Blaise Pascal-Paris VI, 1990. In French.

    Google Scholar 

  58. C. Roucairol. Parallel processing for difficult combinatorial optimization problems. In EURO'XIII. University of Glasgow, July 1994. Tutorial presented at Glasgow, to appear in EJOR 1995, also available as technical report RR-95/04 PRiSM, University of Versailles.

    Google Scholar 

  59. U. K. Sarkar, P. P. Charkrabarti, S. Ghose, and S. C. D. Sarkar. Reducing reexpansions in iterative-deepening search by controlling cutoff bounds. Artificial Intelligence, (50):207–221, 1991.

    Article  MathSciNet  Google Scholar 

  60. W. Shu and L. Kalé. A dynamic scheduling strategy for the chare kernel system. In Supercomputing 89, pages 389–398, 1989.

    Google Scholar 

  61. J. Stasko and J. Vitter. Pairing heap: Experiments and analysis. Technical Report 600, I.N.R.I.A., Feb. 1987.

    Google Scholar 

  62. R. Tarjan and D. Sleator. Self-adjusting binary search trees. Journal of ACM, 32(3):652–686, 1985.

    Article  Google Scholar 

  63. H. Trienekens. Computational experiments with an asynchronous parallel branch and bound algorithm. Eur-cs-89-02, Computer Science Department, Faculty of Economics, Eramus University, Rotterdam, 1989.

    Google Scholar 

  64. B. Wah and Y. Ma. Manip-a multicomputer architecture for solving combinatorial extremum search problems. IEEE Trans. on Comp., C-33(5):377–390, 1984.

    Google Scholar 

  65. J. Williams. Algorithm 232: Heapsort. CACM, 7:347–348, 1964.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. PNN team, PRiSM laboratory, University of Versailles-Saint Quentin en Yvelines, 45 Avenue des Etats-Unis, 78035, Versailles Cedex, France

    Mohamed Benaïchouche, Van-Dat Cung, Salah Dowaji, Bertrand Le Cun, Thierry Mautor & Catherine Roucairol

Authors
  1. Mohamed Benaïchouche
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Van-Dat Cung
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Salah Dowaji
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bertrand Le Cun
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Thierry Mautor
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Catherine Roucairol
    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

Benaïchouche, M., Cung, VD., Dowaji, S., Le Cun, B., Mautor, T., Roucairol, C. (1996). Building a parallel branch and bound library. 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/BFb0027123

Download citation

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

  • 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

Search

Navigation