Integer Optimization by Local Search: A Domain-Independent Approach

Front Cover
Springer Science & Business Media, Aug 4, 1999 - Computers - 144 pages
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

1 Introduction
1
2 Frameworks for Combinatorial Optimization
11
3 Local Search for Integer Constraints
24
4 Case Studies Methodology
53
5 TimeTabling and Sports Scheduling
59
6 Covering and Assignment
81
7 Capacitated Production Planning
94
8 Extensions
107
A A Complete AMPL Model for ACC9798
114
References
123
Index
134
Copyright

Other editions - View all

Common terms and phrases