Parallel branch and bound: principles and personal experiences
Abstract: "The solution of difficult real world optimization problems usually requires far more computational power than offered by todays [sic] fastest computer. However, several computers may work in parallel on the solution of one single problem. Hereby, a way of increasing computational pow...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
København
1995,29
|
| Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1995,29 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The solution of difficult real world optimization problems usually requires far more computational power than offered by todays [sic] fastest computer. However, several computers may work in parallel on the solution of one single problem. Hereby, a way of increasing computational power is created, which scales with advances in hardware, i.e. if processors become 10 times faster, so will execution times for systems built by a number of these processors. If the solution algorithms for the problems in question are well designed, also solution times for these will then decrease by a factor 10. Branch and Bound (B & B) is by far the most widely used tool for solving large scale hard combinatorial optimization problems, and the combination of parallel computing and B & B has now for a number of years been studied in connection with different applications to derive principles for design of efficient parallel B & B algorithms. In this paper I briefly review the principles of sequential B & B and sketch the main trends in parallel Branch and Bound and the problems experienced. Based on personal experiences with parallel B & B over the last 5 years, I then give my view on the applicability of parallel B & B -- where do [sic] one find the large advantages, and which are the ideas to be exploited and pitfalls to be avoided when using parallel B & B in practical problem solving." |
| Beschreibung: | 20 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011046447 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961108s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)38525450 | ||
| 035 | |a (DE-599)BVBBV011046447 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Clausen, Jens |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel branch and bound |b principles and personal experiences |c Jens Clausen |
| 264 | 1 | |a København |c 1995,29 | |
| 300 | |a 20 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,29 | |
| 520 | 3 | |a Abstract: "The solution of difficult real world optimization problems usually requires far more computational power than offered by todays [sic] fastest computer. However, several computers may work in parallel on the solution of one single problem. Hereby, a way of increasing computational power is created, which scales with advances in hardware, i.e. if processors become 10 times faster, so will execution times for systems built by a number of these processors. If the solution algorithms for the problems in question are well designed, also solution times for these will then decrease by a factor 10. Branch and Bound (B & B) is by far the most widely used tool for solving large scale hard combinatorial optimization problems, and the combination of parallel computing and B & B has now for a number of years been studied in connection with different applications to derive principles for design of efficient parallel B & B algorithms. In this paper I briefly review the principles of sequential B & B and sketch the main trends in parallel Branch and Bound and the problems experienced. Based on personal experiences with parallel B & B over the last 5 years, I then give my view on the applicability of parallel B & B -- where do [sic] one find the large advantages, and which are the ideas to be exploited and pitfalls to be avoided when using parallel B & B in practical problem solving." | |
| 650 | 4 | |a Branch and bound algorithms | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,29 |w (DE-604)BV010011493 |9 1995,29 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007397380 | ||
Datensatz im Suchindex
| _version_ | 1804125536232931328 |
|---|---|
| any_adam_object | |
| author | Clausen, Jens |
| author_facet | Clausen, Jens |
| author_role | aut |
| author_sort | Clausen, Jens |
| author_variant | j c jc |
| building | Verbundindex |
| bvnumber | BV011046447 |
| ctrlnum | (OCoLC)38525450 (DE-599)BVBBV011046447 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02429nam a2200325 cb4500</leader><controlfield tag="001">BV011046447</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961108s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38525450</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011046447</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Clausen, Jens</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel branch and bound</subfield><subfield code="b">principles and personal experiences</subfield><subfield code="c">Jens Clausen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="c">1995,29</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,29</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The solution of difficult real world optimization problems usually requires far more computational power than offered by todays [sic] fastest computer. However, several computers may work in parallel on the solution of one single problem. Hereby, a way of increasing computational power is created, which scales with advances in hardware, i.e. if processors become 10 times faster, so will execution times for systems built by a number of these processors. If the solution algorithms for the problems in question are well designed, also solution times for these will then decrease by a factor 10. Branch and Bound (B & B) is by far the most widely used tool for solving large scale hard combinatorial optimization problems, and the combination of parallel computing and B & B has now for a number of years been studied in connection with different applications to derive principles for design of efficient parallel B & B algorithms. In this paper I briefly review the principles of sequential B & B and sketch the main trends in parallel Branch and Bound and the problems experienced. Based on personal experiences with parallel B & B over the last 5 years, I then give my view on the applicability of parallel B & B -- where do [sic] one find the large advantages, and which are the ideas to be exploited and pitfalls to be avoided when using parallel B & B in practical problem solving."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branch and bound 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">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,29</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1995,29</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007397380</subfield></datafield></record></collection> |
| id | DE-604.BV011046447 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:07Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007397380 |
| oclc_num | 38525450 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Clausen, Jens Verfasser aut Parallel branch and bound principles and personal experiences Jens Clausen København 1995,29 20 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1995,29 Abstract: "The solution of difficult real world optimization problems usually requires far more computational power than offered by todays [sic] fastest computer. However, several computers may work in parallel on the solution of one single problem. Hereby, a way of increasing computational power is created, which scales with advances in hardware, i.e. if processors become 10 times faster, so will execution times for systems built by a number of these processors. If the solution algorithms for the problems in question are well designed, also solution times for these will then decrease by a factor 10. Branch and Bound (B & B) is by far the most widely used tool for solving large scale hard combinatorial optimization problems, and the combination of parallel computing and B & B has now for a number of years been studied in connection with different applications to derive principles for design of efficient parallel B & B algorithms. In this paper I briefly review the principles of sequential B & B and sketch the main trends in parallel Branch and Bound and the problems experienced. Based on personal experiences with parallel B & B over the last 5 years, I then give my view on the applicability of parallel B & B -- where do [sic] one find the large advantages, and which are the ideas to be exploited and pitfalls to be avoided when using parallel B & B in practical problem solving." Branch and bound algorithms Combinatorial optimization Operations research Parallel processing (Electronic computers) Datalogisk Institut <København>: DIKU-Rapport 1995,29 (DE-604)BV010011493 1995,29 |
| spellingShingle | Clausen, Jens Parallel branch and bound principles and personal experiences Datalogisk Institut <København>: DIKU-Rapport Branch and bound algorithms Combinatorial optimization Operations research Parallel processing (Electronic computers) |
| title | Parallel branch and bound principles and personal experiences |
| title_auth | Parallel branch and bound principles and personal experiences |
| title_exact_search | Parallel branch and bound principles and personal experiences |
| title_full | Parallel branch and bound principles and personal experiences Jens Clausen |
| title_fullStr | Parallel branch and bound principles and personal experiences Jens Clausen |
| title_full_unstemmed | Parallel branch and bound principles and personal experiences Jens Clausen |
| title_short | Parallel branch and bound |
| title_sort | parallel branch and bound principles and personal experiences |
| title_sub | principles and personal experiences |
| topic | Branch and bound algorithms Combinatorial optimization Operations research Parallel processing (Electronic computers) |
| topic_facet | Branch and bound algorithms Combinatorial optimization Operations research Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT clausenjens parallelbranchandboundprinciplesandpersonalexperiences |