Ant Colony Optimization and Constraint Programming:
Saved in:
| Other Authors: | , |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
London
Wiley
2013
|
| Series: | ISTE
|
| Subjects: | |
| Online Access: | FRO01 UBG01 UPA01 Volltext |
| Item Description: | Chapter 8. From Swarm Intelligence to Ant Colony Optimization Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search |
| Physical Description: | 1 Online-Ressource (248 Seiten) |
| ISBN: | 9781118557563 1118557565 9781118619667 1118619668 |
| DOI: | 10.1002/9781118557563 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043395630 | ||
| 003 | DE-604 | ||
| 005 | 20210322 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 160222s2013 |||| o||u| ||||||eng d | ||
| 020 | |a 9781118557563 |c electronic bk. |9 978-1-118-55756-3 | ||
| 020 | |a 1118557565 |c electronic bk. |9 1-118-55756-5 | ||
| 020 | |a 9781118619667 |c electronic bk. |9 978-1-118-61966-7 | ||
| 020 | |a 1118619668 |c electronic bk. |9 1-118-61966-8 | ||
| 024 | 7 | |a 10.1002/9781118557563 |2 doi | |
| 035 | |a (ZDB-35-WIC)ocn830161655 | ||
| 035 | |a (OCoLC)830161655 | ||
| 035 | |a (DE-599)BVBBV043395630 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-861 |a DE-739 | ||
| 082 | 0 | |a 005.116 | |
| 245 | 1 | 0 | |a Ant Colony Optimization and Constraint Programming |
| 264 | 1 | |a London |b Wiley |c 2013 | |
| 300 | |a 1 Online-Ressource (248 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a ISTE | |
| 500 | |a Chapter 8. From Swarm Intelligence to Ant Colony Optimization | ||
| 500 | |a Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search | ||
| 650 | 7 | |a COMPUTERS / Programming / Open Source |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Software Development & Engineering / General |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Software Development & Engineering / Tools |2 bisacsh | |
| 650 | 7 | |a Ant algorithms |2 fast | |
| 650 | 7 | |a Constraint programming (Computer science) |2 fast | |
| 650 | 7 | |a Mathematical optimization |2 fast | |
| 650 | 7 | |a Swarm intelligence |2 fast | |
| 650 | 4 | |a Constraint programming (Computer science) | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Swarm intelligence | |
| 650 | 4 | |a Ant algorithms | |
| 650 | 0 | 7 | |a Ameisenalgorithmus |0 (DE-588)4704280-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Constraint |g Künstliche Intelligenz |0 (DE-588)4314755-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 653 | |a Electronic books | ||
| 689 | 0 | 0 | |a Ameisenalgorithmus |0 (DE-588)4704280-1 |D s |
| 689 | 0 | 1 | |a Constraint |g Künstliche Intelligenz |0 (DE-588)4314755-0 |D s |
| 689 | 0 | 2 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Solnon, Christine |4 edt | |
| 700 | 1 | |a Jussien, Narendra |4 edt | |
| 856 | 4 | 0 | |u https://doi.org/10.1002/9781118557563 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-35-WIC | ||
| 940 | 1 | |q UBG_PDA_WIC | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028814214 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781118557563 |l FRO01 |p ZDB-35-WIC |q FRO_PDA_WIC |x Verlag |3 Volltext | |
| 966 | e | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781118557563 |l UBG01 |p ZDB-35-WIC |q UBG_PDA_WIC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1002/9781118557563 |l UPA01 |p ZDB-35-WIC |q UPA_PDA_WIC_Kauf |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804175975669301248 |
|---|---|
| any_adam_object | |
| author2 | Solnon, Christine Jussien, Narendra |
| author2_role | edt edt |
| author2_variant | c s cs n j nj |
| author_facet | Solnon, Christine Jussien, Narendra |
| building | Verbundindex |
| bvnumber | BV043395630 |
| collection | ZDB-35-WIC |
| ctrlnum | (ZDB-35-WIC)ocn830161655 (OCoLC)830161655 (DE-599)BVBBV043395630 |
| dewey-full | 005.116 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.116 |
| dewey-search | 005.116 |
| dewey-sort | 15.116 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1002/9781118557563 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03426nmm a2200685zc 4500</leader><controlfield tag="001">BV043395630</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210322 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">160222s2013 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118557563</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-118-55756-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1118557565</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-118-55756-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118619667</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-118-61966-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1118619668</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-118-61966-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1002/9781118557563</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-35-WIC)ocn830161655</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)830161655</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043395630</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-861</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.116</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Ant Colony Optimization and Constraint Programming</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Wiley</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (248 Seiten)</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">ISTE</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Chapter 8. From Swarm Intelligence to Ant Colony Optimization</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Programming / Open Source</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Software Development & Engineering / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Software Development & Engineering / Tools</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ant algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Constraint programming (Computer science)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematical optimization</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Swarm intelligence</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Swarm intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ant algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ameisenalgorithmus</subfield><subfield code="0">(DE-588)4704280-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Constraint</subfield><subfield code="g">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4314755-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Electronic books</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Ameisenalgorithmus</subfield><subfield code="0">(DE-588)4704280-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Constraint</subfield><subfield code="g">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4314755-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Solnon, Christine</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jussien, Narendra</subfield><subfield code="4">edt</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1002/9781118557563</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-35-WIC</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">UBG_PDA_WIC</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028814214</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="966" ind1="e" ind2=" "><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781118557563</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">FRO_PDA_WIC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781118557563</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">UBG_PDA_WIC</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.1002/9781118557563</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">UPA_PDA_WIC_Kauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043395630 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:24:50Z |
| institution | BVB |
| isbn | 9781118557563 1118557565 9781118619667 1118619668 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028814214 |
| oclc_num | 830161655 |
| open_access_boolean | |
| owner | DE-861 DE-739 |
| owner_facet | DE-861 DE-739 |
| physical | 1 Online-Ressource (248 Seiten) |
| psigel | ZDB-35-WIC UBG_PDA_WIC ZDB-35-WIC FRO_PDA_WIC ZDB-35-WIC UBG_PDA_WIC ZDB-35-WIC UPA_PDA_WIC_Kauf |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Wiley |
| record_format | marc |
| series2 | ISTE |
| spelling | Ant Colony Optimization and Constraint Programming London Wiley 2013 1 Online-Ressource (248 Seiten) txt rdacontent c rdamedia cr rdacarrier ISTE Chapter 8. From Swarm Intelligence to Ant Colony Optimization Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search COMPUTERS / Programming / Open Source bisacsh COMPUTERS / Software Development & Engineering / General bisacsh COMPUTERS / Software Development & Engineering / Tools bisacsh Ant algorithms fast Constraint programming (Computer science) fast Mathematical optimization fast Swarm intelligence fast Constraint programming (Computer science) Mathematical optimization Swarm intelligence Ant algorithms Ameisenalgorithmus (DE-588)4704280-1 gnd rswk-swf Constraint Künstliche Intelligenz (DE-588)4314755-0 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Electronic books Ameisenalgorithmus (DE-588)4704280-1 s Constraint Künstliche Intelligenz (DE-588)4314755-0 s Optimierung (DE-588)4043664-0 s 1\p DE-604 Solnon, Christine edt Jussien, Narendra edt https://doi.org/10.1002/9781118557563 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Ant Colony Optimization and Constraint Programming COMPUTERS / Programming / Open Source bisacsh COMPUTERS / Software Development & Engineering / General bisacsh COMPUTERS / Software Development & Engineering / Tools bisacsh Ant algorithms fast Constraint programming (Computer science) fast Mathematical optimization fast Swarm intelligence fast Constraint programming (Computer science) Mathematical optimization Swarm intelligence Ant algorithms Ameisenalgorithmus (DE-588)4704280-1 gnd Constraint Künstliche Intelligenz (DE-588)4314755-0 gnd Optimierung (DE-588)4043664-0 gnd |
| subject_GND | (DE-588)4704280-1 (DE-588)4314755-0 (DE-588)4043664-0 |
| title | Ant Colony Optimization and Constraint Programming |
| title_auth | Ant Colony Optimization and Constraint Programming |
| title_exact_search | Ant Colony Optimization and Constraint Programming |
| title_full | Ant Colony Optimization and Constraint Programming |
| title_fullStr | Ant Colony Optimization and Constraint Programming |
| title_full_unstemmed | Ant Colony Optimization and Constraint Programming |
| title_short | Ant Colony Optimization and Constraint Programming |
| title_sort | ant colony optimization and constraint programming |
| topic | COMPUTERS / Programming / Open Source bisacsh COMPUTERS / Software Development & Engineering / General bisacsh COMPUTERS / Software Development & Engineering / Tools bisacsh Ant algorithms fast Constraint programming (Computer science) fast Mathematical optimization fast Swarm intelligence fast Constraint programming (Computer science) Mathematical optimization Swarm intelligence Ant algorithms Ameisenalgorithmus (DE-588)4704280-1 gnd Constraint Künstliche Intelligenz (DE-588)4314755-0 gnd Optimierung (DE-588)4043664-0 gnd |
| topic_facet | COMPUTERS / Programming / Open Source COMPUTERS / Software Development & Engineering / General COMPUTERS / Software Development & Engineering / Tools Ant algorithms Constraint programming (Computer science) Mathematical optimization Swarm intelligence Ameisenalgorithmus Constraint Künstliche Intelligenz Optimierung |
| url | https://doi.org/10.1002/9781118557563 |
| work_keys_str_mv | AT solnonchristine antcolonyoptimizationandconstraintprogramming AT jussiennarendra antcolonyoptimizationandconstraintprogramming |