• 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
Theoretical Aspects of Local Search

Theoretical Aspects of Local Search

Paperback

Series: Monographs in Theoretical Computer Science. an Eatcs

General ComputersGeneral Mathematics

ISBN10: 3642071481
ISBN13: 9783642071485
Publisher: Springer Nature
Published: Nov 30 2010
Pages: 238
Weight: 0.74
Height: 0.52 Width: 6.00 Depth: 9.00
Language: English

Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature.

Also in

General Computers