Integer Optimization By Local Search: A Domain-Independent Approach by Joachim P. WalserInteger Optimization By Local Search: A Domain-Independent Approach by Joachim P. Walser

Integer Optimization By Local Search: A Domain-Independent Approach

byJoachim P. Walser

Paperback

Pricing and Purchase Info

$103.50

Earn 518 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Integer Optimization By Local Search: A Domain-Independent ApproachFormat:PaperbackDimensions:144 pages

The following ISBNs are associated with this title:

ISBN - 10:3540663673

ISBN - 13:9783540663676

Look for similar items by category:

Reviews

Table of Contents

Frameworks for Combinatorial Optimization.- Local Search for Integer Constraints.- Case Studies Methodology.- Time-Tabling and Sports Scheduling.- Covering and Assignment.- Capacitated Production Planning.- Extensions.