Theory of randomized search heuristics :: foundations and recent developments /
Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last fiv...
Gespeichert in:
| Weitere Verfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore ; Hackensack, NJ :
World Scientific,
©2011.
|
| Schriftenreihe: | Series on theoretical computer science ;
v. 1. |
| Schlagworte: | |
| Online-Zugang: | DE-862 DE-863 |
| Zusammenfassung: | Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications. This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter of this boo. |
| Beschreibung: | 1 online resource (x, 359 pages) : illustrations |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9789814282673 9814282677 1283148285 9781283148283 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn733047761 | ||
| 003 | OCoLC | ||
| 005 | 20250103110447.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 110627s2011 si a ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d EBLCP |d E7B |d MHW |d YDXCP |d OCLCQ |d MERUC |d UIU |d OCLCQ |d DEBSZ |d OCLCQ |d OCLCF |d OCLCQ |d IDEBK |d OCLCQ |d AGLDB |d ZCU |d OCLCQ |d U3W |d OCLCQ |d VTS |d ICG |d INT |d CEF |d OCLCQ |d WYU |d OCLCQ |d STF |d DKC |d OCLCQ |d M8D |d UKAHL |d OCLCQ |d LEAUB |d AJS |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d SXB |d OCLCQ | ||
| 019 | |a 741455134 |a 816846893 |a 1086427699 | ||
| 020 | |a 9789814282673 |q (electronic bk.) | ||
| 020 | |a 9814282677 |q (electronic bk.) | ||
| 020 | |a 1283148285 | ||
| 020 | |a 9781283148283 | ||
| 020 | |z 9789814282666 | ||
| 020 | |z 9814282669 | ||
| 035 | |a (OCoLC)733047761 |z (OCoLC)741455134 |z (OCoLC)816846893 |z (OCoLC)1086427699 | ||
| 050 | 4 | |a QA402.5 |b .T446 2011eb | |
| 072 | 7 | |a MAT |x 017000 |2 bisacsh | |
| 072 | 7 | |a UYAM |2 bicssc | |
| 082 | 7 | |a 519.7 |2 22 | |
| 049 | |a MAIN | ||
| 245 | 0 | 0 | |a Theory of randomized search heuristics : |b foundations and recent developments / |c editors, Anne Auger, Benjamin Doerr. |
| 260 | |a Singapore ; |a Hackensack, NJ : |b World Scientific, |c ©2011. | ||
| 300 | |a 1 online resource (x, 359 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Series on theoretical computer science ; |v vol. 1 | |
| 504 | |a Includes bibliographical references and index. | ||
| 520 | |a Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications. This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter of this boo. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Preface; Contents; 1. Analyzing Randomized Search Heuristics: Tools from Probability Theory Benjamin Doerr; 2. Runtime Analysis of Evolutionary Algorithms for Discrete Optimization Peter S. Oliveto and Xin Yao; 3. Evolutionary Computation in Combinatorial Optimization Daniel Johannsen; 4. Theoretical Aspects of Evolutionary Multiobjective Optimization Dimo Brockho; 5. Memetic Evolutionary Algorithms Dirk Sudholt; 6. Simulated Annealing Thomas Jansen; 7. Theory of Particle Swarm Optimization Carsten Witt; 8. Ant Colony Optimization: Recent Developments in Theoretical Analysis Walter J. Gutjahr. | |
| 650 | 0 | |a Heuristic programming. |0 http://id.loc.gov/authorities/subjects/sh85060557 | |
| 650 | 0 | |a Heuristic algorithms. |0 http://id.loc.gov/authorities/subjects/sh2009010989 | |
| 650 | 6 | |a Programmation heuristique. | |
| 650 | 6 | |a Algorithmes heuristiques. | |
| 650 | 7 | |a MATHEMATICS |x Linear & Nonlinear Programming. |2 bisacsh | |
| 650 | 7 | |a Heuristic algorithms |2 fast | |
| 650 | 7 | |a Heuristic programming |2 fast | |
| 700 | 1 | |a Auger, Anne. |4 edt | |
| 700 | 1 | |a Doerr, Benjamin. |4 edt | |
| 758 | |i has work: |a Theory of randomized search heuristics (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGjt6RfHYC97HKmPyfCw3P |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |t Theory of randomized search heuristics. |d Singapore ; Hackensack, NJ : World Scientific, ©2011 |z 9789814282666 |w (OCoLC)401145783 |
| 830 | 0 | |a Series on theoretical computer science ; |v v. 1. |0 http://id.loc.gov/authorities/names/no2011091626 | |
| 966 | 4 | 0 | |l DE-862 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=373217 |3 Volltext |
| 966 | 4 | 0 | |l DE-863 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=373217 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH25565183 | ||
| 938 | |a EBL - Ebook Library |b EBLB |n EBL737603 | ||
| 938 | |a ebrary |b EBRY |n ebr10480249 | ||
| 938 | |a EBSCOhost |b EBSC |n 373217 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 314828 | ||
| 938 | |a YBP Library Services |b YANK |n 6958473 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-862 | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn733047761 |
|---|---|
| _version_ | 1829094699410915328 |
| adam_text | |
| any_adam_object | |
| author2 | Auger, Anne Doerr, Benjamin |
| author2_role | edt edt |
| author2_variant | a a aa b d bd |
| author_facet | Auger, Anne Doerr, Benjamin |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA402 |
| callnumber-raw | QA402.5 .T446 2011eb |
| callnumber-search | QA402.5 .T446 2011eb |
| callnumber-sort | QA 3402.5 T446 42011EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Preface; Contents; 1. Analyzing Randomized Search Heuristics: Tools from Probability Theory Benjamin Doerr; 2. Runtime Analysis of Evolutionary Algorithms for Discrete Optimization Peter S. Oliveto and Xin Yao; 3. Evolutionary Computation in Combinatorial Optimization Daniel Johannsen; 4. Theoretical Aspects of Evolutionary Multiobjective Optimization Dimo Brockho; 5. Memetic Evolutionary Algorithms Dirk Sudholt; 6. Simulated Annealing Thomas Jansen; 7. Theory of Particle Swarm Optimization Carsten Witt; 8. Ant Colony Optimization: Recent Developments in Theoretical Analysis Walter J. Gutjahr. |
| ctrlnum | (OCoLC)733047761 |
| dewey-full | 519.7 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.7 |
| dewey-search | 519.7 |
| dewey-sort | 3519.7 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04201cam a2200637 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn733047761</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20250103110447.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">110627s2011 si a ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">EBLCP</subfield><subfield code="d">E7B</subfield><subfield code="d">MHW</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">MERUC</subfield><subfield code="d">UIU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AGLDB</subfield><subfield code="d">ZCU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">U3W</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">ICG</subfield><subfield code="d">INT</subfield><subfield code="d">CEF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">STF</subfield><subfield code="d">DKC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">LEAUB</subfield><subfield code="d">AJS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SXB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">741455134</subfield><subfield code="a">816846893</subfield><subfield code="a">1086427699</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814282673</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9814282677</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1283148285</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781283148283</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789814282666</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9814282669</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)733047761</subfield><subfield code="z">(OCoLC)741455134</subfield><subfield code="z">(OCoLC)816846893</subfield><subfield code="z">(OCoLC)1086427699</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA402.5</subfield><subfield code="b">.T446 2011eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">017000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UYAM</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">519.7</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Theory of randomized search heuristics :</subfield><subfield code="b">foundations and recent developments /</subfield><subfield code="c">editors, Anne Auger, Benjamin Doerr.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Singapore ;</subfield><subfield code="a">Hackensack, NJ :</subfield><subfield code="b">World Scientific,</subfield><subfield code="c">©2011.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 359 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Series on theoretical computer science ;</subfield><subfield code="v">vol. 1</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications. This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter of this boo.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Preface; Contents; 1. Analyzing Randomized Search Heuristics: Tools from Probability Theory Benjamin Doerr; 2. Runtime Analysis of Evolutionary Algorithms for Discrete Optimization Peter S. Oliveto and Xin Yao; 3. Evolutionary Computation in Combinatorial Optimization Daniel Johannsen; 4. Theoretical Aspects of Evolutionary Multiobjective Optimization Dimo Brockho; 5. Memetic Evolutionary Algorithms Dirk Sudholt; 6. Simulated Annealing Thomas Jansen; 7. Theory of Particle Swarm Optimization Carsten Witt; 8. Ant Colony Optimization: Recent Developments in Theoretical Analysis Walter J. Gutjahr.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Heuristic programming.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85060557</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Heuristic algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2009010989</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Programmation heuristique.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes heuristiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Linear & Nonlinear Programming.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Heuristic algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Heuristic programming</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Auger, Anne.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Doerr, Benjamin.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Theory of randomized search heuristics (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGjt6RfHYC97HKmPyfCw3P</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Theory of randomized search heuristics.</subfield><subfield code="d">Singapore ; Hackensack, NJ : World Scientific, ©2011</subfield><subfield code="z">9789814282666</subfield><subfield code="w">(OCoLC)401145783</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Series on theoretical computer science ;</subfield><subfield code="v">v. 1.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2011091626</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-862</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=373217</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-863</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=373217</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH25565183</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBL - Ebook Library</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL737603</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10480249</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">373217</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">314828</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6958473</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-862</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn733047761 |
| illustrated | Illustrated |
| indexdate | 2025-04-11T08:37:17Z |
| institution | BVB |
| isbn | 9789814282673 9814282677 1283148285 9781283148283 |
| language | English |
| oclc_num | 733047761 |
| open_access_boolean | |
| owner | MAIN DE-862 DE-BY-FWS DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-862 DE-BY-FWS DE-863 DE-BY-FWS |
| physical | 1 online resource (x, 359 pages) : illustrations |
| psigel | ZDB-4-EBA FWS_PDA_EBA ZDB-4-EBA |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | World Scientific, |
| record_format | marc |
| series | Series on theoretical computer science ; |
| series2 | Series on theoretical computer science ; |
| spelling | Theory of randomized search heuristics : foundations and recent developments / editors, Anne Auger, Benjamin Doerr. Singapore ; Hackensack, NJ : World Scientific, ©2011. 1 online resource (x, 359 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Series on theoretical computer science ; vol. 1 Includes bibliographical references and index. Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications. This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter of this boo. Print version record. Preface; Contents; 1. Analyzing Randomized Search Heuristics: Tools from Probability Theory Benjamin Doerr; 2. Runtime Analysis of Evolutionary Algorithms for Discrete Optimization Peter S. Oliveto and Xin Yao; 3. Evolutionary Computation in Combinatorial Optimization Daniel Johannsen; 4. Theoretical Aspects of Evolutionary Multiobjective Optimization Dimo Brockho; 5. Memetic Evolutionary Algorithms Dirk Sudholt; 6. Simulated Annealing Thomas Jansen; 7. Theory of Particle Swarm Optimization Carsten Witt; 8. Ant Colony Optimization: Recent Developments in Theoretical Analysis Walter J. Gutjahr. Heuristic programming. http://id.loc.gov/authorities/subjects/sh85060557 Heuristic algorithms. http://id.loc.gov/authorities/subjects/sh2009010989 Programmation heuristique. Algorithmes heuristiques. MATHEMATICS Linear & Nonlinear Programming. bisacsh Heuristic algorithms fast Heuristic programming fast Auger, Anne. edt Doerr, Benjamin. edt has work: Theory of randomized search heuristics (Text) https://id.oclc.org/worldcat/entity/E39PCGjt6RfHYC97HKmPyfCw3P https://id.oclc.org/worldcat/ontology/hasWork Print version: Theory of randomized search heuristics. Singapore ; Hackensack, NJ : World Scientific, ©2011 9789814282666 (OCoLC)401145783 Series on theoretical computer science ; v. 1. http://id.loc.gov/authorities/names/no2011091626 |
| spellingShingle | Theory of randomized search heuristics : foundations and recent developments / Series on theoretical computer science ; Preface; Contents; 1. Analyzing Randomized Search Heuristics: Tools from Probability Theory Benjamin Doerr; 2. Runtime Analysis of Evolutionary Algorithms for Discrete Optimization Peter S. Oliveto and Xin Yao; 3. Evolutionary Computation in Combinatorial Optimization Daniel Johannsen; 4. Theoretical Aspects of Evolutionary Multiobjective Optimization Dimo Brockho; 5. Memetic Evolutionary Algorithms Dirk Sudholt; 6. Simulated Annealing Thomas Jansen; 7. Theory of Particle Swarm Optimization Carsten Witt; 8. Ant Colony Optimization: Recent Developments in Theoretical Analysis Walter J. Gutjahr. Heuristic programming. http://id.loc.gov/authorities/subjects/sh85060557 Heuristic algorithms. http://id.loc.gov/authorities/subjects/sh2009010989 Programmation heuristique. Algorithmes heuristiques. MATHEMATICS Linear & Nonlinear Programming. bisacsh Heuristic algorithms fast Heuristic programming fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85060557 http://id.loc.gov/authorities/subjects/sh2009010989 |
| title | Theory of randomized search heuristics : foundations and recent developments / |
| title_auth | Theory of randomized search heuristics : foundations and recent developments / |
| title_exact_search | Theory of randomized search heuristics : foundations and recent developments / |
| title_full | Theory of randomized search heuristics : foundations and recent developments / editors, Anne Auger, Benjamin Doerr. |
| title_fullStr | Theory of randomized search heuristics : foundations and recent developments / editors, Anne Auger, Benjamin Doerr. |
| title_full_unstemmed | Theory of randomized search heuristics : foundations and recent developments / editors, Anne Auger, Benjamin Doerr. |
| title_short | Theory of randomized search heuristics : |
| title_sort | theory of randomized search heuristics foundations and recent developments |
| title_sub | foundations and recent developments / |
| topic | Heuristic programming. http://id.loc.gov/authorities/subjects/sh85060557 Heuristic algorithms. http://id.loc.gov/authorities/subjects/sh2009010989 Programmation heuristique. Algorithmes heuristiques. MATHEMATICS Linear & Nonlinear Programming. bisacsh Heuristic algorithms fast Heuristic programming fast |
| topic_facet | Heuristic programming. Heuristic algorithms. Programmation heuristique. Algorithmes heuristiques. MATHEMATICS Linear & Nonlinear Programming. Heuristic algorithms Heuristic programming |
| work_keys_str_mv | AT augeranne theoryofrandomizedsearchheuristicsfoundationsandrecentdevelopments AT doerrbenjamin theoryofrandomizedsearchheuristicsfoundationsandrecentdevelopments |