|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-540-35854-1 |
003 |
DE-He213 |
005 |
20220112235041.0 |
007 |
cr nn 008mamaa |
008 |
100301s2007 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540358541
|9 978-3-540-35854-1
|
024 |
7 |
|
|a 10.1007/978-3-540-35854-1
|2 doi
|
050 |
|
4 |
|a QA402.5-402.6
|
072 |
|
7 |
|a PBU
|2 bicssc
|
072 |
|
7 |
|a MAT003000
|2 bisacsh
|
072 |
|
7 |
|a PBU
|2 thema
|
082 |
0 |
4 |
|a 519.6
|2 23
|
100 |
1 |
|
|a Michiels, Wil.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
245 |
1 |
0 |
|a Theoretical Aspects of Local Search
|h [electronic resource] /
|c by Wil Michiels, Emile Aarts, Jan Korst.
|
250 |
|
|
|a 1st ed. 2007.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2007.
|
300 |
|
|
|a VIII, 238 p. 70 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Monographs in Theoretical Computer Science. An EATCS Series,
|x 2193-2069
|
505 |
0 |
|
|a Basic Examples -- Indirect Solution Representations -- Properties of Neighborhood Functions -- Performance Guarantees -- Time Complexity -- Metaheuristics -- Asymptotic Convergence of Simulated Annealing.
|
520 |
|
|
|a 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. This is the first book that presents a large collection of theoretical results in a consistent manner, thus providing the reader with a coherent overview of the achievements obtained so far, but also serving as a source of inspiration for the development of novel results in the challenging field of local search.
|
650 |
|
0 |
|a Mathematical optimization.
|
650 |
|
0 |
|a Discrete mathematics.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Optimization.
|
650 |
2 |
4 |
|a Discrete Mathematics.
|
650 |
2 |
4 |
|a Mathematics of Computing.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Artificial Intelligence.
|
700 |
1 |
|
|a Aarts, Emile.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
700 |
1 |
|
|a Korst, Jan.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642071485
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540826224
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540358534
|
830 |
|
0 |
|a Monographs in Theoretical Computer Science. An EATCS Series,
|x 2193-2069
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-540-35854-1
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|