IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-031-78262-6_9.html
   My bibliography  Save this book chapter

The Metaheuristic Strategy for AI Search and Optimization

Author

Listed:
  • Carlos A. S. Oliveira

    (AT&T Labs Inc.)

Abstract

The design of exact algorithms running in polynomial time for problems belonging to the class NP-hard has been one of the main open problems in the area of theoretical computer science. For this reason, when one needs to solve instances of these problems that are sufficiently large, it is necessary to employ methods that may result only in an approximate solution. This chapter discusses metaheuristic strategies that are commonly used in the solution of hard combinatorial optimization problems. Approximation algorithms with performance guarantees offer a powerful approach to tackling NP-hard problems, providing solutions that are provably close to optimal. However, the design of such algorithms relies heavily on the specific properties of the problem and may not be generalizable across different problem domains. For problems where no approximation guarantee is feasible, heuristic methods remain an essential tool in the practitioner’s arsenal.

Suggested Citation

  • Carlos A. S. Oliveira, 2025. "The Metaheuristic Strategy for AI Search and Optimization," Springer Optimization and Its Applications,, Springer.
    • Handle: RePEc:spr:spochp:978-3-031-78262-6_9
    DOI: 10.1007/978-3-031-78262-6_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-031-78262-6_9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.