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

AI Techniques for Combinatorial Optimization

Author

Listed:
  • Carlos A. S. Oliveira

    (AT&T Labs Inc.)

Abstract

Optimization problems are prevalent across various industrial sectors such as agriculture, transportation, and administration, where the goal is to efficiently allocate resources to achieve specific objectives. These problems often involve minimizing or maximizing a function subject to constraints, and they can be mathematically formalized as a set of equalities and inequalities. Depending on the nature of the objective function and constraints, optimization problems can be classified into different categories, including linear programming and combinatorial optimization. This paper introduces the fundamental concepts of optimization problems, provides examples of real-world applications, and delves into specific problem types such as the Traveling Salesman Problem (TSP) and the Knapsack Problem. The TSP, a well-known combinatorial optimization problem, seeks the shortest possible route that visits a set of cities exactly once and returns to the origin, with applications ranging from circuit design to logistics. The Knapsack Problem, another classic example, involves selecting items with maximum value within a given capacity, with practical applications in resource allocation and investment decisions. Despite their simple formulations, both problems pose significant computational challenges, particularly when finding optimal solutions for large instances.

Suggested Citation

  • Carlos A. S. Oliveira, 2025. "AI Techniques for Combinatorial Optimization," Springer Optimization and Its Applications,, Springer.
  • Handle: RePEc:spr:spochp:978-3-031-78262-6_7
    DOI: 10.1007/978-3-031-78262-6_7
    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_7. 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.