Skip to main content
SpringerLink
Log in

Heuristic Search

  • Reference work entry
Encyclopedia of Optimization

  • 326 Accesses

Article Outline

Keywords and Phrases

Introduction

Depth-First Search

Best-First Search

Applications

See also

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper Res 25(1):30–44

    MATH  Google Scholar 

  2. Knuth DE, Moore RW (1975) An analysis of alpha-beta pruning. Artif Intell 6(4):293–326

    Article  MATH  MathSciNet  Google Scholar 

  3. Korf RE (1985) Depth-first iterative-deepening: An optimal admissible tree search. Artif Intell 27:97–109

    Article  MATH  MathSciNet  Google Scholar 

  4. Korf RE, Zhang W, Thayer I, Hohwald H (2005) Frontier Search J ACM 52:715–748

    MathSciNet  Google Scholar 

  5. Kumar V, Nau DS, Kanal L (1988) A general branch-and-bound formulation for AND/OR graph and game-tree search. In: Kanal L, Kumar V (eds) Search in Artificial Intelligence. Springer, New York, pp 91–130

    Google Scholar 

  6. Lawler EL, Wood DE (1966) Branch and bound methods: A survey. Oper Res 14:600–719

    MathSciNet  Google Scholar 

  7. Nilsson NJ (1980) Principles of artificial intelligence. Tioga Publ., Palo Alto

    MATH  Google Scholar 

  8. Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization: Algorithms and complexity. Prentice-Hall, Englewood Cliffs, NJ

    MATH  Google Scholar 

  9. Pearl J (1984) Heuristics. Intelligent search strategies for computer problem solving. Addison-Wesley, Reading

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ZIB Berlin, Berlin, Germany

    Alexander Reinefeld

Authors
  1. Alexander Reinefeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Reinefeld, A. (2008). Heuristic Search . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_263

Download citation

Publish with us

Policies and ethics

Search

Navigation