10% off all books and free delivery over £50
Buy from our bookstore and 25% of the cover price will be given to a school of your choice to buy more books. *15% of eBooks.

Integer Optimization by Local Search

View All Editions (1)

The selected edition of this book is not available to buy right now.
Add To Wishlist
Write A Review

About

Integer Optimization by Local Search Synopsis

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.

About This Edition

ISBN: 9783540663676
Publication date:
Author: Joachim Paul Walser
Publisher: Springer an imprint of Springer Berlin Heidelberg
Format: Paperback
Pagination: 137 pages
Series: Lecture Notes in Computer Science ; Lecture Notes in Artificial Intelligence
Genres: Artificial intelligence
Maths for computer scientists
Algorithms and data structures
Business mathematics and systems
Discrete mathematics
Optimization
Business applications

Frequently asked questions