Integer Optimization by Local Search

1. Front Matter

   Pages I-XVII

   PDF

2. Introduction

   • Fred Glover

   Pages 1-10

3. Frameworks for Combinatorial Optimization

   Pages 11-23

4. Local Search for Integer Constraints

   Pages 25-52

5. Case Studies Methodology

   • John N. Hooker

   Pages 53-58

6. Time-Tabling and Sports Scheduling

   Pages 59-79

7. Covering and Assignment

   Pages 81-93

8. Capacitated Production Planning

   Pages 95-105

9. Extensions

   Pages 107-113

10. Back Matter

    Pages 115-137

    PDF

Integer Optimization addresses a wide spectrum of practically important optimization problems and represents a major challenge for algorithmics. The goal of integer optimization is to solve a system of constraints and optimization criteria over discrete variables.
Integer Optimization by Local Search introduces a new approach to domain-independent integer optimization, which, unlike traditional strategies, is based on local search. It develops the central concepts and strategies of integer local search and describes possible combinations with classical methods from linear programming. The surprising effectiveness of the approach is demonstrated in a variety of case studies on large-scale, realistic problems, including production planning, timetabling, radar surveillance, and sports scheduling. The monograph is written for practitioners and researchers from artificial intelligence and operations research.

• Extension
• Local Search
• Planning
• Variable
• algorithmics
• algorithms
• artificial intelligence
• combinatorial optimization
• intelligence
• linear optimization
• operations research
• optimization
• production
• programming
• scheduling
• algorithm analysis and problem complexity

Policies and ethics