Integer Optimization by Local Search: A Domain-Independent Approach

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 1637 : Lecture Notes in Artificial Intelligence

ISBN: 3540663673, 9783540663676

Size: 763 kB (781776 bytes)

Pages: 144/131

File format:

Language:

Publishing Year:

Category: Tags: , , , , ,

Fred Glover (auth.), Joachim Paul Walser (eds.)3540663673, 9783540663676

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.

Table of contents :
Introduction….Pages 1-10
Frameworks for Combinatorial Optimization….Pages 11-23
Local Search for Integer Constraints….Pages 25-52
Case Studies Methodology….Pages 53-58
Time-Tabling and Sports Scheduling….Pages 59-79
Covering and Assignment….Pages 81-93
Capacitated Production Planning….Pages 95-105
Extensions….Pages 107-113

Reviews

There are no reviews yet.

Be the first to review “Integer Optimization by Local Search: A Domain-Independent Approach”
Shopping Cart
Scroll to Top