The Annealing Algorithm:
The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem. All...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
1989
|
| Schriftenreihe: | The Kluwer International Series in Engineering and Computer Science, VLSI, Computer Architecture and Digital Signal Processing
72 |
| Schlagworte: | |
| Online-Zugang: | BTU01 Volltext |
| Zusammenfassung: | The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem. All that is needed to run annealing on such a problem is a unique representation for each configuration, a procedure for measuring its quality, and a neighbor relation. Much more is needed however for obtaining acceptable results consistently in a reasonably short time. It is even doubtful whether the problem can be formulated such that annealing becomes an adequate approach for all instances of an optimization problem. Questions such as what is the best formulation for a given instance, and how should the process be controlled, have to be answered. Although much progress has been made in the years after the introduction of the concept into the field of combinatorial optimization in 1981, some important questions still do not have a definitive answer. In this book the reader will find the foundations of annealing in a self-contained and consistent presentation. Although the physical analogue from which the con cept emanated is mentioned in the first chapter, all theory is developed within the framework of markov chains. To achieve a high degree of instance independence adaptive strategies are introduced |
| Beschreibung: | 1 Online-Ressource (XII, 202 p) |
| ISBN: | 9781461316275 |
| DOI: | 10.1007/978-1-4613-1627-5 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV045186374 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180912s1989 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461316275 |9 978-1-4613-1627-5 | ||
| 024 | 7 | |a 10.1007/978-1-4613-1627-5 |2 doi | |
| 035 | |a (ZDB-2-ENG)978-1-4613-1627-5 | ||
| 035 | |a (OCoLC)1053825866 | ||
| 035 | |a (DE-599)BVBBV045186374 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 620.00420285 |2 23 | |
| 100 | 1 | |a Otten, R. H. J. M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The Annealing Algorithm |c by R. H. J. M. Otten, L. P. P. P. van Ginneken |
| 264 | 1 | |a Boston, MA |b Springer US |c 1989 | |
| 300 | |a 1 Online-Ressource (XII, 202 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a The Kluwer International Series in Engineering and Computer Science, VLSI, Computer Architecture and Digital Signal Processing |v 72 | |
| 520 | |a The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem. All that is needed to run annealing on such a problem is a unique representation for each configuration, a procedure for measuring its quality, and a neighbor relation. Much more is needed however for obtaining acceptable results consistently in a reasonably short time. It is even doubtful whether the problem can be formulated such that annealing becomes an adequate approach for all instances of an optimization problem. Questions such as what is the best formulation for a given instance, and how should the process be controlled, have to be answered. Although much progress has been made in the years after the introduction of the concept into the field of combinatorial optimization in 1981, some important questions still do not have a definitive answer. In this book the reader will find the foundations of annealing in a self-contained and consistent presentation. Although the physical analogue from which the con cept emanated is mentioned in the first chapter, all theory is developed within the framework of markov chains. To achieve a high degree of instance independence adaptive strategies are introduced | ||
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Computer-Aided Engineering (CAD, CAE) and Design | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Electrical Engineering | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Computer-aided engineering | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Electrical engineering | |
| 700 | 1 | |a Ginneken, L. P. P. P. van |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461288992 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4613-1627-5 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-ENG | ||
| 940 | 1 | |q ZDB-2-ENG_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030575551 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4613-1627-5 |l BTU01 |p ZDB-2-ENG |q ZDB-2-ENG_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804178877293002752 |
|---|---|
| any_adam_object | |
| author | Otten, R. H. J. M. Ginneken, L. P. P. P. van |
| author_facet | Otten, R. H. J. M. Ginneken, L. P. P. P. van |
| author_role | aut aut |
| author_sort | Otten, R. H. J. M. |
| author_variant | r h j m o rhjm rhjmo l p p p v g lpppv lpppvg |
| building | Verbundindex |
| bvnumber | BV045186374 |
| collection | ZDB-2-ENG |
| ctrlnum | (ZDB-2-ENG)978-1-4613-1627-5 (OCoLC)1053825866 (DE-599)BVBBV045186374 |
| dewey-full | 620.00420285 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 620 - Engineering and allied operations |
| dewey-raw | 620.00420285 |
| dewey-search | 620.00420285 |
| dewey-sort | 3620.00420285 |
| dewey-tens | 620 - Engineering and allied operations |
| doi_str_mv | 10.1007/978-1-4613-1627-5 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03168nmm a2200481zcb4500</leader><controlfield tag="001">BV045186374</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180912s1989 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461316275</subfield><subfield code="9">978-1-4613-1627-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4613-1627-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-ENG)978-1-4613-1627-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1053825866</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045186374</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">620.00420285</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Otten, R. H. J. M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Annealing Algorithm</subfield><subfield code="c">by R. H. J. M. Otten, L. P. P. P. van Ginneken</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 202 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">The Kluwer International Series in Engineering and Computer Science, VLSI, Computer Architecture and Digital Signal Processing</subfield><subfield code="v">72</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem. All that is needed to run annealing on such a problem is a unique representation for each configuration, a procedure for measuring its quality, and a neighbor relation. Much more is needed however for obtaining acceptable results consistently in a reasonably short time. It is even doubtful whether the problem can be formulated such that annealing becomes an adequate approach for all instances of an optimization problem. Questions such as what is the best formulation for a given instance, and how should the process be controlled, have to be answered. Although much progress has been made in the years after the introduction of the concept into the field of combinatorial optimization in 1981, some important questions still do not have a definitive answer. In this book the reader will find the foundations of annealing in a self-contained and consistent presentation. Although the physical analogue from which the con cept emanated is mentioned in the first chapter, all theory is developed within the framework of markov chains. To achieve a high degree of instance independence adaptive strategies are introduced</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer-Aided Engineering (CAD, CAE) and Design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer-aided engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical engineering</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ginneken, L. P. P. P. van</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781461288992</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4613-1627-5</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-ENG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-ENG_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030575551</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4613-1627-5</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="q">ZDB-2-ENG_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV045186374 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:10:57Z |
| institution | BVB |
| isbn | 9781461316275 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030575551 |
| oclc_num | 1053825866 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (XII, 202 p) |
| psigel | ZDB-2-ENG ZDB-2-ENG_Archiv ZDB-2-ENG ZDB-2-ENG_Archiv |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Springer US |
| record_format | marc |
| series2 | The Kluwer International Series in Engineering and Computer Science, VLSI, Computer Architecture and Digital Signal Processing |
| spelling | Otten, R. H. J. M. Verfasser aut The Annealing Algorithm by R. H. J. M. Otten, L. P. P. P. van Ginneken Boston, MA Springer US 1989 1 Online-Ressource (XII, 202 p) txt rdacontent c rdamedia cr rdacarrier The Kluwer International Series in Engineering and Computer Science, VLSI, Computer Architecture and Digital Signal Processing 72 The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem. All that is needed to run annealing on such a problem is a unique representation for each configuration, a procedure for measuring its quality, and a neighbor relation. Much more is needed however for obtaining acceptable results consistently in a reasonably short time. It is even doubtful whether the problem can be formulated such that annealing becomes an adequate approach for all instances of an optimization problem. Questions such as what is the best formulation for a given instance, and how should the process be controlled, have to be answered. Although much progress has been made in the years after the introduction of the concept into the field of combinatorial optimization in 1981, some important questions still do not have a definitive answer. In this book the reader will find the foundations of annealing in a self-contained and consistent presentation. Although the physical analogue from which the con cept emanated is mentioned in the first chapter, all theory is developed within the framework of markov chains. To achieve a high degree of instance independence adaptive strategies are introduced Computer Science Computer-Aided Engineering (CAD, CAE) and Design Combinatorics Electrical Engineering Computer science Computer-aided engineering Electrical engineering Ginneken, L. P. P. P. van aut Erscheint auch als Druck-Ausgabe 9781461288992 https://doi.org/10.1007/978-1-4613-1627-5 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Otten, R. H. J. M. Ginneken, L. P. P. P. van The Annealing Algorithm Computer Science Computer-Aided Engineering (CAD, CAE) and Design Combinatorics Electrical Engineering Computer science Computer-aided engineering Electrical engineering |
| title | The Annealing Algorithm |
| title_auth | The Annealing Algorithm |
| title_exact_search | The Annealing Algorithm |
| title_full | The Annealing Algorithm by R. H. J. M. Otten, L. P. P. P. van Ginneken |
| title_fullStr | The Annealing Algorithm by R. H. J. M. Otten, L. P. P. P. van Ginneken |
| title_full_unstemmed | The Annealing Algorithm by R. H. J. M. Otten, L. P. P. P. van Ginneken |
| title_short | The Annealing Algorithm |
| title_sort | the annealing algorithm |
| topic | Computer Science Computer-Aided Engineering (CAD, CAE) and Design Combinatorics Electrical Engineering Computer science Computer-aided engineering Electrical engineering |
| topic_facet | Computer Science Computer-Aided Engineering (CAD, CAE) and Design Combinatorics Electrical Engineering Computer science Computer-aided engineering Electrical engineering |
| url | https://doi.org/10.1007/978-1-4613-1627-5 |
| work_keys_str_mv | AT ottenrhjm theannealingalgorithm AT ginnekenlpppvan theannealingalgorithm |