Local Search in Combinatorial Optimization
In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining hi...
Gespeichert in:
Weitere Verfasser: | , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Princeton, NJ
Princeton University Press
[2018]
|
Schlagworte: | |
Online-Zugang: | DE-Aug4 DE-859 DE-860 DE-739 DE-1046 DE-1043 DE-858 URL des Erstveröffentlichers |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV045878985 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 190515s2018 xx o|||| 00||| eng d | ||
020 | |a 9780691187563 |9 978-0-691-18756-3 | ||
024 | 7 | |a 10.1515/9780691187563 |2 doi | |
035 | |a (ZDB-23-DGG)9780691187563 | ||
035 | |a (OCoLC)1101917083 | ||
035 | |a (DE-599)BVBBV045878985 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-Aug4 |a DE-859 |a DE-860 |a DE-739 |a DE-1046 |a DE-1043 |a DE-858 | ||
082 | 0 | |a 519.7 |2 22 | |
245 | 1 | 0 | |a Local Search in Combinatorial Optimization |c Emile Aarts, Jan Karel Lenstra |
264 | 1 | |a Princeton, NJ |b Princeton University Press |c [2018] | |
264 | 4 | |c © 2003 | |
300 | |a 1 online resource | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
500 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 23. Nov 2018) | ||
520 | |a In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergård | ||
546 | |a In English | ||
650 | 4 | |a Algorithms | |
650 | 4 | |a Combinatorial optimization | |
650 | 4 | |a Heuristic programming | |
650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Heuristische Programmierung |0 (DE-588)4434810-1 |2 gnd |9 rswk-swf |
655 | 7 | |8 1\p |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
689 | 0 | 0 | |a Heuristische Programmierung |0 (DE-588)4434810-1 |D s |
689 | 0 | |8 2\p |5 DE-604 | |
689 | 1 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
689 | 1 | |8 3\p |5 DE-604 | |
700 | 1 | |a Aarts, Emile |4 edt | |
700 | 1 | |a Lenstra, Jan Karel |4 edt | |
856 | 4 | 0 | |u https://doi.org/10.1515/9780691187563 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-23-DGG | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-031262162 | |
966 | e | |u https://doi.org/10.1515/9780691187563?locatt=mode:legacy |l DE-Aug4 |p ZDB-23-DGG |q FHA_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691187563?locatt=mode:legacy |l DE-859 |p ZDB-23-DGG |q FKE_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691187563?locatt=mode:legacy |l DE-860 |p ZDB-23-DGG |q FLA_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691187563?locatt=mode:legacy |l DE-739 |p ZDB-23-DGG |q UPA_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691187563?locatt=mode:legacy |l DE-1046 |p ZDB-23-DGG |q FAW_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691187563?locatt=mode:legacy |l DE-1043 |p ZDB-23-DGG |q FAB_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691187563?locatt=mode:legacy |l DE-858 |p ZDB-23-DGG |q FCO_PDA_DGG |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1819305986103443457 |
---|---|
any_adam_object | |
author2 | Aarts, Emile Lenstra, Jan Karel |
author2_role | edt edt |
author2_variant | e a ea j k l jk jkl |
author_facet | Aarts, Emile Lenstra, Jan Karel |
building | Verbundindex |
bvnumber | BV045878985 |
collection | ZDB-23-DGG |
ctrlnum | (ZDB-23-DGG)9780691187563 (OCoLC)1101917083 (DE-599)BVBBV045878985 |
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 |
doi_str_mv | 10.1515/9780691187563 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04170nam a2200613zc 4500</leader><controlfield tag="001">BV045878985</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">190515s2018 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780691187563</subfield><subfield code="9">978-0-691-18756-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9780691187563</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-23-DGG)9780691187563</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1101917083</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045878985</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-1043</subfield><subfield code="a">DE-858</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7</subfield><subfield code="2">22</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Local Search in Combinatorial Optimization</subfield><subfield code="c">Emile Aarts, Jan Karel Lenstra</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ</subfield><subfield code="b">Princeton University Press</subfield><subfield code="c">[2018]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource</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="500" ind1=" " ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 23. Nov 2018)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergård</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Heuristic programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Heuristische Programmierung</subfield><subfield code="0">(DE-588)4434810-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Heuristische Programmierung</subfield><subfield code="0">(DE-588)4434810-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Aarts, Emile</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lenstra, Jan Karel</subfield><subfield code="4">edt</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9780691187563</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-23-DGG</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031262162</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691187563?locatt=mode:legacy</subfield><subfield code="l">DE-Aug4</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FHA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691187563?locatt=mode:legacy</subfield><subfield code="l">DE-859</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FKE_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691187563?locatt=mode:legacy</subfield><subfield code="l">DE-860</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FLA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691187563?locatt=mode:legacy</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">UPA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691187563?locatt=mode:legacy</subfield><subfield code="l">DE-1046</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAW_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691187563?locatt=mode:legacy</subfield><subfield code="l">DE-1043</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAB_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691187563?locatt=mode:legacy</subfield><subfield code="l">DE-858</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FCO_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
genre | 1\p (DE-588)4143413-4 Aufsatzsammlung gnd-content |
genre_facet | Aufsatzsammlung |
id | DE-604.BV045878985 |
illustrated | Not Illustrated |
indexdate | 2024-12-24T07:29:37Z |
institution | BVB |
isbn | 9780691187563 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031262162 |
oclc_num | 1101917083 |
open_access_boolean | |
owner | DE-Aug4 DE-859 DE-860 DE-739 DE-1046 DE-1043 DE-858 |
owner_facet | DE-Aug4 DE-859 DE-860 DE-739 DE-1046 DE-1043 DE-858 |
physical | 1 online resource |
psigel | ZDB-23-DGG ZDB-23-DGG FHA_PDA_DGG ZDB-23-DGG FKE_PDA_DGG ZDB-23-DGG FLA_PDA_DGG ZDB-23-DGG UPA_PDA_DGG ZDB-23-DGG FAW_PDA_DGG ZDB-23-DGG FAB_PDA_DGG ZDB-23-DGG FCO_PDA_DGG |
publishDate | 2018 |
publishDateSearch | 2018 |
publishDateSort | 2018 |
publisher | Princeton University Press |
record_format | marc |
spelling | Local Search in Combinatorial Optimization Emile Aarts, Jan Karel Lenstra Princeton, NJ Princeton University Press [2018] © 2003 1 online resource txt rdacontent c rdamedia cr rdacarrier Description based on online resource; title from PDF title page (publisher's Web site, viewed 23. Nov 2018) In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergård In English Algorithms Combinatorial optimization Heuristic programming Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Heuristische Programmierung (DE-588)4434810-1 gnd rswk-swf 1\p (DE-588)4143413-4 Aufsatzsammlung gnd-content Heuristische Programmierung (DE-588)4434810-1 s 2\p DE-604 Kombinatorische Optimierung (DE-588)4031826-6 s 3\p DE-604 Aarts, Emile edt Lenstra, Jan Karel edt https://doi.org/10.1515/9780691187563 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Local Search in Combinatorial Optimization Algorithms Combinatorial optimization Heuristic programming Kombinatorische Optimierung (DE-588)4031826-6 gnd Heuristische Programmierung (DE-588)4434810-1 gnd |
subject_GND | (DE-588)4031826-6 (DE-588)4434810-1 (DE-588)4143413-4 |
title | Local Search in Combinatorial Optimization |
title_auth | Local Search in Combinatorial Optimization |
title_exact_search | Local Search in Combinatorial Optimization |
title_full | Local Search in Combinatorial Optimization Emile Aarts, Jan Karel Lenstra |
title_fullStr | Local Search in Combinatorial Optimization Emile Aarts, Jan Karel Lenstra |
title_full_unstemmed | Local Search in Combinatorial Optimization Emile Aarts, Jan Karel Lenstra |
title_short | Local Search in Combinatorial Optimization |
title_sort | local search in combinatorial optimization |
topic | Algorithms Combinatorial optimization Heuristic programming Kombinatorische Optimierung (DE-588)4031826-6 gnd Heuristische Programmierung (DE-588)4434810-1 gnd |
topic_facet | Algorithms Combinatorial optimization Heuristic programming Kombinatorische Optimierung Heuristische Programmierung Aufsatzsammlung |
url | https://doi.org/10.1515/9780691187563 |
work_keys_str_mv | AT aartsemile localsearchincombinatorialoptimization AT lenstrajankarel localsearchincombinatorialoptimization |