TY  - BOOK
AU  - Walser,Joachim Paul
ED  - SpringerLink (Online service)
TI  - Integer Optimization by Local Search: A Domain-Independent Approach 
T2  - Lecture Notes in Computer Science,
SN  - 9783540483694
AV  - Q334-342 
U1  - 006.3 23
PY  - 1999///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer software
KW  - Computational complexity
KW  - Artificial intelligence
KW  - Mathematical optimization
KW  - Management information systems
KW  - Computer Science
KW  - Artificial Intelligence (incl. Robotics)
KW  - Algorithm Analysis and Problem Complexity
KW  - Discrete Mathematics in Computer Science
KW  - Business Information Systems
KW  - Calculus of Variations and Optimal Control; Optimization
N1  - Frameworks for Combinatorial Optimization -- Local Search for Integer Constraints -- Case Studies Methodology -- Time-Tabling and Sports Scheduling -- Covering and Assignment -- Capacitated Production Planning -- Extensions
N2  - 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
UR  - http://dx.doi.org/10.1007/3-540-48369-1
ER  -