On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel:
Abstract: "The quadratic assignment problem (QAP) belongs to the hard core of NP-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not su...
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
København
1996
|
| Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1996,24 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The quadratic assignment problem (QAP) belongs to the hard core of NP-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not sufficient. Recently, lower bounds based on decomposition were proposed for the so called rectilinear QAP that proved to be the strongest for a large class of problem instances. We investigate a) the difficulty of incorporating new bound functions devised and implemented by one research team in a parallel code devised and implemented by another team, and b) the strength of these bounds when applied not only at the root node of a search tree but as the bound function used in a Branch-and-Bound code solving large scale QAPs." |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011544010 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 970923s1996 |||| 00||| eng d | ||
| 035 | |a (OCoLC)38214865 | ||
| 035 | |a (DE-599)BVBBV011544010 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 245 | 1 | 0 | |a On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel |c Jens Clausen ... |
| 264 | 1 | |a København |c 1996 | |
| 300 | |a 19 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 1996,24 | |
| 520 | 3 | |a Abstract: "The quadratic assignment problem (QAP) belongs to the hard core of NP-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not sufficient. Recently, lower bounds based on decomposition were proposed for the so called rectilinear QAP that proved to be the strongest for a large class of problem instances. We investigate a) the difficulty of incorporating new bound functions devised and implemented by one research team in a parallel code devised and implemented by another team, and b) the strength of these bounds when applied not only at the root node of a search tree but as the bound function used in a Branch-and-Bound code solving large scale QAPs." | |
| 650 | 4 | |a Branch and bound algorithms | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Programming (Mathematics) | |
| 700 | 1 | |a Clausen, Jens |e Sonstige |4 oth | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1996,24 |w (DE-604)BV010011493 |9 1996,24 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007771497 | ||
Datensatz im Suchindex
| _version_ | 1804126067489767424 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV011544010 |
| ctrlnum | (OCoLC)38214865 (DE-599)BVBBV011544010 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01897nam a2200325 cb4500</leader><controlfield tag="001">BV011544010</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970923s1996 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38214865</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011544010</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="245" ind1="1" ind2="0"><subfield code="a">On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel</subfield><subfield code="c">Jens Clausen ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">1996,24</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The quadratic assignment problem (QAP) belongs to the hard core of NP-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not sufficient. Recently, lower bounds based on decomposition were proposed for the so called rectilinear QAP that proved to be the strongest for a large class of problem instances. We investigate a) the difficulty of incorporating new bound functions devised and implemented by one research team in a parallel code devised and implemented by another team, and b) the strength of these bounds when applied not only at the root node of a search tree but as the bound function used in a Branch-and-Bound code solving large scale QAPs."</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">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Clausen, Jens</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1996,24</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1996,24</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007771497</subfield></datafield></record></collection> |
| id | DE-604.BV011544010 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:11:34Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007771497 |
| oclc_num | 38214865 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 19 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel Jens Clausen ... København 1996 19 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1996,24 Abstract: "The quadratic assignment problem (QAP) belongs to the hard core of NP-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not sufficient. Recently, lower bounds based on decomposition were proposed for the so called rectilinear QAP that proved to be the strongest for a large class of problem instances. We investigate a) the difficulty of incorporating new bound functions devised and implemented by one research team in a parallel code devised and implemented by another team, and b) the strength of these bounds when applied not only at the root node of a search tree but as the bound function used in a Branch-and-Bound code solving large scale QAPs." Branch and bound algorithms Combinatorial optimization Parallel processing (Electronic computers) Programming (Mathematics) Clausen, Jens Sonstige oth Datalogisk Institut <København>: DIKU-Rapport 1996,24 (DE-604)BV010011493 1996,24 |
| spellingShingle | On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel Datalogisk Institut <København>: DIKU-Rapport Branch and bound algorithms Combinatorial optimization Parallel processing (Electronic computers) Programming (Mathematics) |
| title | On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel |
| title_auth | On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel |
| title_exact_search | On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel |
| title_full | On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel Jens Clausen ... |
| title_fullStr | On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel Jens Clausen ... |
| title_full_unstemmed | On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel Jens Clausen ... |
| title_short | On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel |
| title_sort | on the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel |
| topic | Branch and bound algorithms Combinatorial optimization Parallel processing (Electronic computers) Programming (Mathematics) |
| topic_facet | Branch and bound algorithms Combinatorial optimization Parallel processing (Electronic computers) Programming (Mathematics) |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT clausenjens ontheapplicabilityoflowerboundsforsolvingrectilinearquadraticassignmentproblemsinparallel |