Advertisement

Integer Optimization by Local Search

A Domain-Independent Approach

  • Editors
  • Joachim Paul Walser

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1637)

Also part of the Lecture Notes in Artificial Intelligence book sub series (volume 1637)

Table of contents

  1. Front Matter
    Pages I-XVII
  2. Fred Glover
    Pages 1-10
  3. John N. Hooker
    Pages 53-58
  4. Pages 107-113
  5. Back Matter
    Pages 115-137

About this book

Introduction

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.

Keywords

Extension Local Search Planning Variable algorithmics algorithms artificial intelligence combinatorial optimization intelligence linear optimization operations research optimization production programming scheduling

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-48369-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66367-6
  • Online ISBN 978-3-540-48369-4
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site