Geometric Algorithms and Combinatorial Optimization:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1993
|
| Ausgabe: | Second Corrected Edition |
| Schriftenreihe: | Algorithms and Combinatorics
2 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs |
| Beschreibung: | 1 Online-Ressource (XII, 362p. 23 illus) |
| ISBN: | 9783642782404 9783642782428 |
| ISSN: | 0937-5511 |
| DOI: | 10.1007/978-3-642-78240-4 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042423002 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1993 |||| o||u| ||||||eng d | ||
| 020 | |a 9783642782404 |c Online |9 978-3-642-78240-4 | ||
| 020 | |a 9783642782428 |c Print |9 978-3-642-78242-8 | ||
| 024 | 7 | |a 10.1007/978-3-642-78240-4 |2 doi | |
| 035 | |a (OCoLC)863817301 | ||
| 035 | |a (DE-599)BVBBV042423002 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 511.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Grötschel, Martin |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Geometric Algorithms and Combinatorial Optimization |c by Martin Grötschel, László Lovász, Alexander Schrijver |
| 250 | |a Second Corrected Edition | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 1993 | |
| 300 | |a 1 Online-Ressource (XII, 362p. 23 illus) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Algorithms and Combinatorics |v 2 |x 0937-5511 | |
| 500 | |a Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Systems theory | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Economics | |
| 650 | 4 | |a Systems Theory, Control | |
| 650 | 4 | |a Calculus of Variations and Optimal Control; Optimization | |
| 650 | 4 | |a Economic Theory | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Wirtschaft | |
| 650 | 0 | 7 | |a Polyedrische Kombinatorik |0 (DE-588)4132100-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Geometrie |0 (DE-588)4140733-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Geometrie |0 (DE-588)4020236-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | 1 | |a Polyedrische Kombinatorik |0 (DE-588)4132100-5 |D s |
| 689 | 0 | 2 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 1 | 1 | |a Geometrie |0 (DE-588)4020236-7 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 2 | 1 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 689 | 3 | 0 | |a Kombinatorische Geometrie |0 (DE-588)4140733-7 |D s |
| 689 | 3 | |8 4\p |5 DE-604 | |
| 700 | 1 | |a Lovász, László |e Sonstige |4 oth | |
| 700 | 1 | |a Schrijver, Alexander |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-78240-4 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027858419 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153098161094656 |
|---|---|
| any_adam_object | |
| author | Grötschel, Martin |
| author_facet | Grötschel, Martin |
| author_role | aut |
| author_sort | Grötschel, Martin |
| author_variant | m g mg |
| building | Verbundindex |
| bvnumber | BV042423002 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)863817301 (DE-599)BVBBV042423002 |
| dewey-full | 511.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.6 |
| dewey-search | 511.6 |
| dewey-sort | 3511.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-3-642-78240-4 |
| edition | Second Corrected Edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04687nmm a2200781zcb4500</leader><controlfield tag="001">BV042423002</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1993 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642782404</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-78240-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642782428</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-642-78242-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-78240-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863817301</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042423002</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Grötschel, Martin</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Geometric Algorithms and Combinatorial Optimization</subfield><subfield code="c">by Martin Grötschel, László Lovász, Alexander Schrijver</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second Corrected Edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 362p. 23 illus)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Algorithms and Combinatorics</subfield><subfield code="v">2</subfield><subfield code="x">0937-5511</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systems theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Economics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systems Theory, Control</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculus of Variations and Optimal Control; Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Economic Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wirtschaft</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polyedrische Kombinatorik</subfield><subfield code="0">(DE-588)4132100-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Geometrie</subfield><subfield code="0">(DE-588)4140733-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Geometrie</subfield><subfield code="0">(DE-588)4020236-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Polyedrische Kombinatorik</subfield><subfield code="0">(DE-588)4132100-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Geometrie</subfield><subfield code="0">(DE-588)4020236-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Kombinatorische Geometrie</subfield><subfield code="0">(DE-588)4140733-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lovász, László</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schrijver, Alexander</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-78240-4</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027858419</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042423002 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:12Z |
| institution | BVB |
| isbn | 9783642782404 9783642782428 |
| issn | 0937-5511 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027858419 |
| oclc_num | 863817301 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XII, 362p. 23 illus) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Algorithms and Combinatorics |
| spelling | Grötschel, Martin Verfasser aut Geometric Algorithms and Combinatorial Optimization by Martin Grötschel, László Lovász, Alexander Schrijver Second Corrected Edition Berlin, Heidelberg Springer Berlin Heidelberg 1993 1 Online-Ressource (XII, 362p. 23 illus) txt rdacontent c rdamedia cr rdacarrier Algorithms and Combinatorics 2 0937-5511 Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs Mathematics Systems theory Combinatorics Mathematical optimization Economics Systems Theory, Control Calculus of Variations and Optimal Control; Optimization Economic Theory Mathematik Wirtschaft Polyedrische Kombinatorik (DE-588)4132100-5 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Kombinatorische Geometrie (DE-588)4140733-7 gnd rswk-swf Geometrie (DE-588)4020236-7 gnd rswk-swf Polynomialzeitalgorithmus (DE-588)4199652-5 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 s Polyedrische Kombinatorik (DE-588)4132100-5 s Polynomialzeitalgorithmus (DE-588)4199652-5 s 1\p DE-604 Geometrie (DE-588)4020236-7 s 2\p DE-604 Algorithmische Geometrie (DE-588)4130267-9 s 3\p DE-604 Kombinatorische Geometrie (DE-588)4140733-7 s 4\p DE-604 Lovász, László Sonstige oth Schrijver, Alexander Sonstige oth https://doi.org/10.1007/978-3-642-78240-4 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Grötschel, Martin Geometric Algorithms and Combinatorial Optimization Mathematics Systems theory Combinatorics Mathematical optimization Economics Systems Theory, Control Calculus of Variations and Optimal Control; Optimization Economic Theory Mathematik Wirtschaft Polyedrische Kombinatorik (DE-588)4132100-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Kombinatorische Geometrie (DE-588)4140733-7 gnd Geometrie (DE-588)4020236-7 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd |
| subject_GND | (DE-588)4132100-5 (DE-588)4031826-6 (DE-588)4140733-7 (DE-588)4020236-7 (DE-588)4199652-5 (DE-588)4130267-9 |
| title | Geometric Algorithms and Combinatorial Optimization |
| title_auth | Geometric Algorithms and Combinatorial Optimization |
| title_exact_search | Geometric Algorithms and Combinatorial Optimization |
| title_full | Geometric Algorithms and Combinatorial Optimization by Martin Grötschel, László Lovász, Alexander Schrijver |
| title_fullStr | Geometric Algorithms and Combinatorial Optimization by Martin Grötschel, László Lovász, Alexander Schrijver |
| title_full_unstemmed | Geometric Algorithms and Combinatorial Optimization by Martin Grötschel, László Lovász, Alexander Schrijver |
| title_short | Geometric Algorithms and Combinatorial Optimization |
| title_sort | geometric algorithms and combinatorial optimization |
| topic | Mathematics Systems theory Combinatorics Mathematical optimization Economics Systems Theory, Control Calculus of Variations and Optimal Control; Optimization Economic Theory Mathematik Wirtschaft Polyedrische Kombinatorik (DE-588)4132100-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Kombinatorische Geometrie (DE-588)4140733-7 gnd Geometrie (DE-588)4020236-7 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd |
| topic_facet | Mathematics Systems theory Combinatorics Mathematical optimization Economics Systems Theory, Control Calculus of Variations and Optimal Control; Optimization Economic Theory Mathematik Wirtschaft Polyedrische Kombinatorik Kombinatorische Optimierung Kombinatorische Geometrie Geometrie Polynomialzeitalgorithmus Algorithmische Geometrie |
| url | https://doi.org/10.1007/978-3-642-78240-4 |
| work_keys_str_mv | AT grotschelmartin geometricalgorithmsandcombinatorialoptimization AT lovaszlaszlo geometricalgorithmsandcombinatorialoptimization AT schrijveralexander geometricalgorithmsandcombinatorialoptimization |