The Steiner tree packing problem in VLSI-design:
Abstract: "In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routi...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
1994
|
| Schriftenreihe: | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC
1994,2 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we developed and implemented for these two models. We report on computational experiments using standard test instances. Our codes are able to determine optimum solutions in most cases, and in particular, we can show that some of the instances have no feasible solution if Manhattan routing is used instead of knock-knee routing." |
| Beschreibung: | 21 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009231035 | ||
| 003 | DE-604 | ||
| 005 | 20200217 | ||
| 007 | t | ||
| 008 | 940318s1994 d||| |||| 00||| engod | ||
| 035 | |a (OCoLC)32423587 | ||
| 035 | |a (DE-599)BVBBV009231035 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 | ||
| 100 | 1 | |a Grötschel, Martin |d 1948- |e Verfasser |0 (DE-588)108975282 |4 aut | |
| 245 | 1 | 0 | |a The Steiner tree packing problem in VLSI-design |c Martin Grötschel ; Alexander Martin ; Robert Weismantel |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 1994 | |
| 300 | |a 21 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1994,2 | |
| 520 | 3 | |a Abstract: "In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we developed and implemented for these two models. We report on computational experiments using standard test instances. Our codes are able to determine optimum solutions in most cases, and in particular, we can show that some of the instances have no feasible solution if Manhattan routing is used instead of knock-knee routing." | |
| 650 | 4 | |a Steiner systems | |
| 700 | 1 | |a Martin, Alexander |d 1965- |e Verfasser |0 (DE-588)1013264479 |4 aut | |
| 700 | 1 | |a Weismantel, Robert |e Verfasser |4 aut | |
| 830 | 0 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1994,2 |w (DE-604)BV004801715 |9 1994,2 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006139417 | ||
Datensatz im Suchindex
| _version_ | 1804123675315666944 |
|---|---|
| any_adam_object | |
| author | Grötschel, Martin 1948- Martin, Alexander 1965- Weismantel, Robert |
| author_GND | (DE-588)108975282 (DE-588)1013264479 |
| author_facet | Grötschel, Martin 1948- Martin, Alexander 1965- Weismantel, Robert |
| author_role | aut aut aut |
| author_sort | Grötschel, Martin 1948- |
| author_variant | m g mg a m am r w rw |
| building | Verbundindex |
| bvnumber | BV009231035 |
| ctrlnum | (OCoLC)32423587 (DE-599)BVBBV009231035 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01891nam a2200313 cb4500</leader><controlfield tag="001">BV009231035</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200217 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940318s1994 d||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32423587</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009231035</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-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Grötschel, Martin</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)108975282</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Steiner tree packing problem in VLSI-design</subfield><subfield code="c">Martin Grötschel ; Alexander Martin ; Robert Weismantel</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">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21 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">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1994,2</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we developed and implemented for these two models. We report on computational experiments using standard test instances. Our codes are able to determine optimum solutions in most cases, and in particular, we can show that some of the instances have no feasible solution if Manhattan routing is used instead of knock-knee routing."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Steiner systems</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="700" ind1="1" ind2=" "><subfield code="a">Weismantel, Robert</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1994,2</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1994,2</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006139417</subfield></datafield></record></collection> |
| id | DE-604.BV009231035 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:33:32Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006139417 |
| oclc_num | 32423587 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 21 S. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |
| series2 | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |
| spelling | Grötschel, Martin 1948- Verfasser (DE-588)108975282 aut The Steiner tree packing problem in VLSI-design Martin Grötschel ; Alexander Martin ; Robert Weismantel Berlin Konrad-Zuse-Zentrum für Informationstechnik 1994 21 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1994,2 Abstract: "In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we developed and implemented for these two models. We report on computational experiments using standard test instances. Our codes are able to determine optimum solutions in most cases, and in particular, we can show that some of the instances have no feasible solution if Manhattan routing is used instead of knock-knee routing." Steiner systems Martin, Alexander 1965- Verfasser (DE-588)1013264479 aut Weismantel, Robert Verfasser aut Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1994,2 (DE-604)BV004801715 1994,2 |
| spellingShingle | Grötschel, Martin 1948- Martin, Alexander 1965- Weismantel, Robert The Steiner tree packing problem in VLSI-design Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC Steiner systems |
| title | The Steiner tree packing problem in VLSI-design |
| title_auth | The Steiner tree packing problem in VLSI-design |
| title_exact_search | The Steiner tree packing problem in VLSI-design |
| title_full | The Steiner tree packing problem in VLSI-design Martin Grötschel ; Alexander Martin ; Robert Weismantel |
| title_fullStr | The Steiner tree packing problem in VLSI-design Martin Grötschel ; Alexander Martin ; Robert Weismantel |
| title_full_unstemmed | The Steiner tree packing problem in VLSI-design Martin Grötschel ; Alexander Martin ; Robert Weismantel |
| title_short | The Steiner tree packing problem in VLSI-design |
| title_sort | the steiner tree packing problem in vlsi design |
| topic | Steiner systems |
| topic_facet | Steiner systems |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT grotschelmartin thesteinertreepackingprobleminvlsidesign AT martinalexander thesteinertreepackingprobleminvlsidesign AT weismantelrobert thesteinertreepackingprobleminvlsidesign |