A polyhedral approach to network connectivity problems: (extended abstract)
Abstract: "We present a polyhedral approach for the general problem of designing a minimum-cost network with specified connectivity requirements. This includes identifying classes of facet-defining inequalities and using them in a cutting plane approach for obtaining optimal or near-optimal sol...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik Berlin
1992
|
| Schriftenreihe: | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC
1992,22 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We present a polyhedral approach for the general problem of designing a minimum-cost network with specified connectivity requirements. This includes identifying classes of facet-defining inequalities and using them in a cutting plane approach for obtaining optimal or near-optimal solutions. Preliminary computational results with this approach are presented." |
| Beschreibung: | 11 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006706307 | ||
| 003 | DE-604 | ||
| 005 | 19930709 | ||
| 007 | t | ||
| 008 | 930405s1992 gw |||| 00||| eng d | ||
| 035 | |a (OCoLC)28940258 | ||
| 035 | |a (DE-599)BVBBV006706307 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 | ||
| 100 | 1 | |a Grötschel, Martin |d 1948- |e Verfasser |0 (DE-588)108975282 |4 aut | |
| 245 | 1 | 0 | |a A polyhedral approach to network connectivity problems |b (extended abstract) |c M. Grötschel ; C. L. Monma ; M. Stoer |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik Berlin |c 1992 | |
| 300 | |a 11 S. | ||
| 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 1992,22 | |
| 520 | 3 | |a Abstract: "We present a polyhedral approach for the general problem of designing a minimum-cost network with specified connectivity requirements. This includes identifying classes of facet-defining inequalities and using them in a cutting plane approach for obtaining optimal or near-optimal solutions. Preliminary computational results with this approach are presented." | |
| 650 | 4 | |a Operations research | |
| 700 | 1 | |a Monma, Clyde L. |e Verfasser |4 aut | |
| 700 | 1 | |a Stoer, Mechthild |e Verfasser |4 aut | |
| 830 | 0 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1992,22 |w (DE-604)BV004801715 |9 1992,22 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-004263147 | ||
Datensatz im Suchindex
| _version_ | 1804120947740901376 |
|---|---|
| any_adam_object | |
| author | Grötschel, Martin 1948- Monma, Clyde L. Stoer, Mechthild |
| author_GND | (DE-588)108975282 |
| author_facet | Grötschel, Martin 1948- Monma, Clyde L. Stoer, Mechthild |
| author_role | aut aut aut |
| author_sort | Grötschel, Martin 1948- |
| author_variant | m g mg c l m cl clm m s ms |
| building | Verbundindex |
| bvnumber | BV006706307 |
| ctrlnum | (OCoLC)28940258 (DE-599)BVBBV006706307 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01533nam a2200325 cb4500</leader><controlfield tag="001">BV006706307</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19930709 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930405s1992 gw |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28940258</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006706307</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</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">A polyhedral approach to network connectivity problems</subfield><subfield code="b">(extended abstract)</subfield><subfield code="c">M. Grötschel ; C. L. Monma ; M. Stoer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11 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">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1992,22</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a polyhedral approach for the general problem of designing a minimum-cost network with specified connectivity requirements. This includes identifying classes of facet-defining inequalities and using them in a cutting plane approach for obtaining optimal or near-optimal solutions. Preliminary computational results with this approach are presented."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Monma, Clyde L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stoer, Mechthild</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">1992,22</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1992,22</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004263147</subfield></datafield></record></collection> |
| id | DE-604.BV006706307 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:50:11Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004263147 |
| oclc_num | 28940258 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 11 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik Berlin |
| 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 A polyhedral approach to network connectivity problems (extended abstract) M. Grötschel ; C. L. Monma ; M. Stoer Berlin Konrad-Zuse-Zentrum für Informationstechnik Berlin 1992 11 S. txt rdacontent n rdamedia nc rdacarrier Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1992,22 Abstract: "We present a polyhedral approach for the general problem of designing a minimum-cost network with specified connectivity requirements. This includes identifying classes of facet-defining inequalities and using them in a cutting plane approach for obtaining optimal or near-optimal solutions. Preliminary computational results with this approach are presented." Operations research Monma, Clyde L. Verfasser aut Stoer, Mechthild Verfasser aut Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1992,22 (DE-604)BV004801715 1992,22 |
| spellingShingle | Grötschel, Martin 1948- Monma, Clyde L. Stoer, Mechthild A polyhedral approach to network connectivity problems (extended abstract) Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC Operations research |
| title | A polyhedral approach to network connectivity problems (extended abstract) |
| title_auth | A polyhedral approach to network connectivity problems (extended abstract) |
| title_exact_search | A polyhedral approach to network connectivity problems (extended abstract) |
| title_full | A polyhedral approach to network connectivity problems (extended abstract) M. Grötschel ; C. L. Monma ; M. Stoer |
| title_fullStr | A polyhedral approach to network connectivity problems (extended abstract) M. Grötschel ; C. L. Monma ; M. Stoer |
| title_full_unstemmed | A polyhedral approach to network connectivity problems (extended abstract) M. Grötschel ; C. L. Monma ; M. Stoer |
| title_short | A polyhedral approach to network connectivity problems |
| title_sort | a polyhedral approach to network connectivity problems extended abstract |
| title_sub | (extended abstract) |
| topic | Operations research |
| topic_facet | Operations research |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT grotschelmartin apolyhedralapproachtonetworkconnectivityproblemsextendedabstract AT monmaclydel apolyhedralapproachtonetworkconnectivityproblemsextendedabstract AT stoermechthild apolyhedralapproachtonetworkconnectivityproblemsextendedabstract |