ENGLISH

Integer Optimization by Local Search: A Domain-Independent Approach

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1999
ISBN
978-3-540-66367-6, 978-3-540-48369-4
DOI
10.1007/3-540-48369-1
Language
english
Format
PDF
Filesize
2 MB (2235440 bytes)
Series
Lecture Notes in Computer Science 1637
Edition
1
Pages
144\145
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00

Description

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.

Similar books