Skip to main content

Part of the book series: Macmillan Computer Science Series

  • 118 Accesses

Abstract

When presented with a mathematical model problem P M the problem-solver generally prefers to solve it exactly, that is to find a solution xM* guaranteed to be optimal. This is a natural attitude but there are several reasons why, in particular cases, it may be inappropriate to insist on an exact method.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1982 T. B. Boffey

About this chapter

Cite this chapter

Boffey, T.B. (1982). Heuristic Methods. In: Graph Theory in Operations Research. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-16675-6_11

Download citation

Publish with us

Policies and ethics