Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Integer Optimization by Local Search: A Domain-Independent Approach

Integer Optimization by Local Search: A Domain-Independent Approach

Kautz, H.
Walser, Joachim P.

Paperback

Medical ReferenceGeneral ComputersGeneral Mathematics

ISBN10: 3540663673
ISBN13: 9783540663676
Publisher: Springer
Published: Aug 4 1999
Pages: 144
Weight: 0.53
Height: 0.35 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Mathematics

View All