Skip to main content
SpringerLink
Log in

Comparing two probabilistic models of the computational complexity of the branch and bound algorithm

  • Conference paper
  • First Online:
Parallel Processing: CONPAR 94 — VAPP VI (VAPP 1994, CONPAR 1994)

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

Abstract

We study two probabilistic models developed in order to predict the computational complexity of the branch and bound algorithm as well as its suitability for a parallelization based on the simultaneous exploration of all subproblems having a same common lower bound We show that both models, starting from different assumptions, yield asymptotically the same results but differ for small problems. Both models agree to predict a quick increase of the number of subproblems as a function of their lower bounds offering a convenient approach for parallelization of the branch and bound algorithm.

Work done as a Master's Thesis of ENS-Lyon, realized at EPFL.

Work supported by the SPP-IF program of the Swiss National Science Foundation.

Work realized during a longer visit at EPFL supported by the SPP-IF program.

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. Garey, M. R., Johnson, D. S.: Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)

    Google Scholar 

  2. Gengler, M., Coray, G.: A Parallel Best-first B&B with Synchronization Phases. Proceedings CONPAR'92-VAPP V, LNCS 634 (1992) 515–526

    Google Scholar 

  3. Gengler, M., Coray, G.: A Parallel Best-first B&B Algorithm and its Axiomatization. IEEE Proceedings HICSS-26, Vol. 2 (1993) 263–272

    Google Scholar 

  4. Johnson, D. S.: A Catalog of Complexity Classes. Algorithms and Complexity Vol. A, J. Van Leeuwen (ed.), Elsevier & MIT Press (1990) 67–161

    Google Scholar 

  5. Mitten, L. G.: Branch and Bound Methods: General Formulation and Properties. Operations Research 18 (1970) 24–34

    Google Scholar 

  6. Rinnooy Kan, A. H. G.: On Mitten's Axioms for Branch and Bound. Graduate School of Management, Delft, Tech. Rep. W/74/45/03 (1974)

    Google Scholar 

  7. Quinn, M. J.: Designing Efficient Algorithms for Parallel Computers. McGraw-Hill (1987)

    Google Scholar 

  8. Wah, B. W., Yu, C. F.: Probabilistic Modeling of Branch and Bound Algorithms. Proceedings COMPSAC (1982) 647–653

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure - Lyon, 46, Allée d'Italie, F-69007, Lyon, France

    Michèle Dion

  2. Laboratoire d'Informatique Théorique, Ecublens (IN), Ecole Polytechnique Fédérale de Lausanne, CH-1015, Lausanne, Switzerland

    Marc Gengler

  3. Laboratoire de Traitement du Signal et Instrumentation, Université de Saint-Etienne, F-42000, Saint-Etienne, France

    Stéphane Ubéda

Authors
  1. Michèle Dion
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Gengler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stéphane Ubéda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bruno Buchberger Jens Volkert

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dion, M., Gengler, M., Ubéda, S. (1994). Comparing two probabilistic models of the computational complexity of the branch and bound algorithm. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-58430-7_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58430-8

  • Online ISBN: 978-3-540-48789-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation