Solving Steiner tree problems in graphs to optimality:
Abstract: "In this paper we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms and primal heuristics. We are abl...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
1996
|
| Schriftenreihe: | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin
1996,42 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms and primal heuristics. We are able to solve all problem instances discussed in literature to optimality, including one to our knowledge not yet solved problem. We also report on our computational experiences with some very large Steiner tree problems arising from the design of electronic circuits. All test problems are gathered in a newly introduced library called SteinLib that is accessible via World Wide Web." |
| Beschreibung: | 31 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV017187057 | ||
| 003 | DE-604 | ||
| 005 | 20200217 | ||
| 007 | t| | ||
| 008 | 030603s1996 xx d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)37710003 | ||
| 035 | |a (DE-599)BVBBV017187057 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 | ||
| 100 | 1 | |a Koch, Thorsten |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Solving Steiner tree problems in graphs to optimality |c Thorsten Koch ; Alexander Martin |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 1996 | |
| 300 | |a 31 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |v 1996,42 | |
| 520 | 3 | |a Abstract: "In this paper we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms and primal heuristics. We are able to solve all problem instances discussed in literature to optimality, including one to our knowledge not yet solved problem. We also report on our computational experiences with some very large Steiner tree problems arising from the design of electronic circuits. All test problems are gathered in a newly introduced library called SteinLib that is accessible via World Wide Web." | |
| 650 | 4 | |a Branch and bound algorithms | |
| 650 | 4 | |a Steiner systems | |
| 650 | 4 | |a Trees (Graph theory) | |
| 700 | 1 | |a Martin, Alexander |d 1965- |e Verfasser |0 (DE-588)1013264479 |4 aut | |
| 810 | 2 | |a Konrad-Zuse-Zentrum für Informationstechnik Berlin |t Preprint SC |v 1996,42 |w (DE-604)BV004801715 |9 1996,42 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-010358205 | |
Datensatz im Suchindex
| _version_ | 1820882503733346304 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Koch, Thorsten Martin, Alexander 1965- |
| author_GND | (DE-588)1013264479 |
| author_facet | Koch, Thorsten Martin, Alexander 1965- |
| author_role | aut aut |
| author_sort | Koch, Thorsten |
| author_variant | t k tk a m am |
| building | Verbundindex |
| bvnumber | BV017187057 |
| classification_rvk | SS 4777 |
| ctrlnum | (OCoLC)37710003 (DE-599)BVBBV017187057 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV017187057</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200217</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">030603s1996 xx d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37710003</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017187057</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Koch, Thorsten</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Solving Steiner tree problems in graphs to optimality</subfield><subfield code="c">Thorsten Koch ; Alexander Martin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">31 S.</subfield><subfield code="b">graph. Darst.</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">Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="v">1996,42</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms and primal heuristics. We are able to solve all problem instances discussed in literature to optimality, including one to our knowledge not yet solved problem. We also report on our computational experiences with some very large Steiner tree problems arising from the design of electronic circuits. All test problems are gathered in a newly introduced library called SteinLib that is accessible via World Wide Web."</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">Steiner systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Martin, Alexander</subfield><subfield code="d">1965-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1013264479</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="t">Preprint SC</subfield><subfield code="v">1996,42</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1996,42</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010358205</subfield></datafield></record></collection> |
| id | DE-604.BV017187057 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:07:56Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010358205 |
| oclc_num | 37710003 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | 31 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series2 | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |
| spelling | Koch, Thorsten Verfasser aut Solving Steiner tree problems in graphs to optimality Thorsten Koch ; Alexander Martin Berlin Konrad-Zuse-Zentrum für Informationstechnik 1996 31 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin 1996,42 Abstract: "In this paper we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms and primal heuristics. We are able to solve all problem instances discussed in literature to optimality, including one to our knowledge not yet solved problem. We also report on our computational experiences with some very large Steiner tree problems arising from the design of electronic circuits. All test problems are gathered in a newly introduced library called SteinLib that is accessible via World Wide Web." Branch and bound algorithms Steiner systems Trees (Graph theory) Martin, Alexander 1965- Verfasser (DE-588)1013264479 aut Konrad-Zuse-Zentrum für Informationstechnik Berlin Preprint SC 1996,42 (DE-604)BV004801715 1996,42 |
| spellingShingle | Koch, Thorsten Martin, Alexander 1965- Solving Steiner tree problems in graphs to optimality Branch and bound algorithms Steiner systems Trees (Graph theory) |
| title | Solving Steiner tree problems in graphs to optimality |
| title_auth | Solving Steiner tree problems in graphs to optimality |
| title_exact_search | Solving Steiner tree problems in graphs to optimality |
| title_full | Solving Steiner tree problems in graphs to optimality Thorsten Koch ; Alexander Martin |
| title_fullStr | Solving Steiner tree problems in graphs to optimality Thorsten Koch ; Alexander Martin |
| title_full_unstemmed | Solving Steiner tree problems in graphs to optimality Thorsten Koch ; Alexander Martin |
| title_short | Solving Steiner tree problems in graphs to optimality |
| title_sort | solving steiner tree problems in graphs to optimality |
| topic | Branch and bound algorithms Steiner systems Trees (Graph theory) |
| topic_facet | Branch and bound algorithms Steiner systems Trees (Graph theory) |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT kochthorsten solvingsteinertreeproblemsingraphstooptimality AT martinalexander solvingsteinertreeproblemsingraphstooptimality |