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.

Bibliographic Information

Book Title: Integer Optimization by Local Search
Book Subtitle: A Domain-Independent Approach
Editors: Joachim Paul Walser
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-48369-1
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1999
Softcover ISBN: 978-3-540-66367-6Published: 04 August 1999
eBook ISBN: 978-3-540-48369-4Published: 26 June 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XX, 144
Topics: Artificial Intelligence, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, IT in Business, Calculus of Variations and Optimal Control; Optimization

Publish with us

Policies and ethics

Integer Optimization by Local Search

Overview

Access this book

Other ways to access

Table of contents (8 chapters)

Front Matter

Back Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation