12. Tools for Tree Searches: Branch-and-Bound and A Algorithms

  1. Enrique Alba1,
  2. Christian Blum2,
  3. Pedro Isasi3,
  4. Coromoto León4 and
  5. Juan Antonio Gómez5
  1. C. León,
  2. G. Miranda and
  3. C. Rodríguez

Published Online: 16 MAY 2008

DOI: 10.1002/9780470411353.ch12

Optimization Techniques for Solving Complex Problems

Optimization Techniques for Solving Complex Problems

How to Cite

León, C., Miranda, G. and Rodríguez, C. (2009) Tools for Tree Searches: Branch-and-Bound and A Algorithms, in Optimization Techniques for Solving Complex Problems (eds E. Alba, C. Blum, P. Isasi, C. León and J. A. Gómez), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470411353.ch12

Editor Information

  1. 1

    Universidad de Málaga, Dpto. de Lenguajes y Ciencias de la Computación, Málaga, Spain

  2. 2

    Universitat Politècnica de Catalunya, Dpto. de Llenguatges i Sistemes Informàtics, Barcelona, Spain

  3. 3

    Universidad Carlos III de Madrid, Dpto. de Informática, Escuela Politécnica Superior, Madrid, Spain

  4. 4

    Universidad de La Laguna, Dpto. de Estadística, I.O. y Computación, La Laguna, Spain

  5. 5

    Universidad de Extremadura, Dpto. de Tecnologías de Computadores y Comunicaciones, Escuela Politécnica, Cáceres, Spain

Author Information

  1. Universidad de La Laguna, Dpto. de Estadística, I.O. y Computación, La Laguna, Spain

Publication History

  1. Published Online: 16 MAY 2008
  2. Published Print: 6 FEB 2009

Book Series:

  1. Wiley Series on Parallel and Distributed Computing

Book Series Editors:

  1. Albert Y. Zomaya

ISBN Information

Print ISBN: 9780470293324

Online ISBN: 9780470411353

SEARCH

Keywords:

  • search space;
  • tree search algorithm;
  • shared-memory parallel solver

Summary

This chapter contains sections titled:

  • Introduction

  • Background

  • Algorithmic Skeleton for Tree Searches

  • Experimentation Methodology

  • Experimental Results

  • Conclusions

  • References