Combinatorial optimization: theory and algorithms
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2006
|
| Ausgabe: | 3. ed. |
| Schriftenreihe: | Algorithms and combinatorics
21 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XV, 597 S. Ill., graph. Darst. |
| ISBN: | 3540256849 9783540256847 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV020040983 | ||
| 003 | DE-604 | ||
| 005 | 20060503 | ||
| 007 | t | ||
| 008 | 050922s2006 ad|| |||| 00||| eng d | ||
| 020 | |a 3540256849 |9 3-540-25684-9 | ||
| 020 | |a 9783540256847 |9 978-3-540-25684-7 | ||
| 035 | |a (OCoLC)254652176 | ||
| 035 | |a (DE-599)BVBBV020040983 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-29T |a DE-91G |a DE-83 |a DE-11 |a DE-188 | ||
| 082 | 0 | |a 519.64 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 913f |2 stub | ||
| 084 | |a 68R10 |2 msc | ||
| 084 | |a 17,1 |2 ssgn | ||
| 084 | |a 90C27 |2 msc | ||
| 084 | |a 65K05 |2 msc | ||
| 100 | 1 | |a Korte, Bernhard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Combinatorial optimization |b theory and algorithms |c Bernhard Korte ; Jens Vygen |
| 250 | |a 3. ed. | ||
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2006 | |
| 300 | |a XV, 597 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Algorithms and combinatorics |v 21 | |
| 650 | 4 | |a Kombinatorische Optimierung - Lehrbuch | |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Vygen, Jens |d 1967- |e Verfasser |0 (DE-588)14204086X |4 aut | |
| 830 | 0 | |a Algorithms and combinatorics |v 21 |w (DE-604)BV000617357 |9 21 | |
| 856 | 4 | 2 | |m HEBIS Datenaustausch Darmstadt |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013362065&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
Datensatz im Suchindex
| _version_ | 1805081664256212992 |
|---|---|
| adam_text |
BERNHARD KORTE JENS VYGEN COMBINATORIAL OPTIMIZATION THEORY AND
ALGORITHMS THIRD EDITION 4Y SPRINGER TABLE OF CONTENTS 1. INTRODUCTION 1
1.1 ENUMERATION 2 1.2 RUNNING TIME OF ALGORITHMS 5 1.3 LINEAR
OPTIMIZATION PROBLEMS 8 1.4 SORTING 9 EXERCISES 11 REFERENCES 12 2.
GRAPHS 13 2.1 BASIC DEFINITIONS 13 2.2 TREES, CIRCUITS, AND CUTS 17 2.3
CONNECTIVITY 24 2.4 EULERIAN AND BIPARTITE GRAPHS 30 2.5 PLANARITY 33
2.6 PLANAR DUALITY 40 EXERCISES 42 REFERENCES 46 3. LINEAR PROGRAMMING
49 3.1 POLYHEDRA 50 3.2 THE SIMPLEX ALGORITHM 53 3.3 DUALITY 57 3.4
CONVEX HULLS AND POLYTOPES 60 EXERCISES 62 REFERENCES 63 4. LINEAR
PROGRAMMING ALGORITHMS 65 4.1 SIZE OF VERTICES AND FACES 65 4.2
CONTINUED FRACTIONS 68 4.3 GAUSSIAN ELIMINATION 70 4.4 THE ELLIPSOID
METHOD 74 4.5 KHACHIYAN'S THEOREM 80 4.6 SEPARATION AND OPTIMIZATION 82
EXERCISES 88 REFERENCES 90 XII TABLE OF CONTENTS 5. INTEGER PROGRAMMING
91 5.1 THE INTEGER HULL OF A POLYHEDRON 92 5.2 UNIMODULAR
TRANSFORMATIONS 96 5.3 TOTAL DUAL INTEGRALITY 97 5.4 TOTALLY UNIMODULAR
MATRICES 101 5.5 CUTTING PLANES 106 5.6 LAGRANGEAN RELAXATION 110
EXERCISES 112 REFERENCES 115 6. SPANNING TREES AND ARBORESCENCES 119 6.1
MINIMUM SPANNING TREES 119 6.2 MINIMUM WEIGHT ARBORESCENCES 125 6.3
POLYHEDRAL DESCRIPTIONS 129 6.4 PACKING SPANNING TREES AND ARBORESCENCES
132 EXERCISES 136 REFERENCES 139 7. SHORTEST PATHS 143 7.1 SHORTEST
PATHS FROM ONE SOURCE 144 7.2 SHORTEST PATHS BETWEEN ALL PAIRS OF
VERTICES 148 7.3 MINIMUM MEAN CYCLES 151 EXERCISES 153 REFERENCES 155 8.
NETWORK FLOWS 157 8.1 MAX-FLOW-MIN-CUT THEOREM 158 8.2 MENGER'S THEOREM
162 8.3 THE EDMONDS-KARP ALGORITHM 164 8.4 BLOCKING FLOWS AND
FUJISHIGE'S ALGORITHM 166 8.5 THE GOLDBERG-TARJAN ALGORITHM 168 8.6
GOMORY-HU TREES 172 8.7 THE MINIMUM CUT IN AN UNDIRECTED GRAPH 179
EXERCISES 181 REFERENCES 186 9. MINIMUM COST FLOWS 191 9.1 PROBLEM
FORMULATION 191 9.2 AN OPTIMALITY CRITERION 193 9.3 MINIMUM MEAN
CYCLE-CANCELLING ALGORITHM 195 9.4 SUCCESSIVE SHORTEST PATH ALGORITHM
199 9.5 ORLIN'S ALGORITHM 203 9.6 FLOWS OVER TIME 206 EXERCISES 208
REFERENCES 212 TABLE OF CONTENTS XIII 10. MAXIMUM MATCHINGS 215 10.1
BIPARTITE MATCHING 216 10.2 THE TUTTE MATRIX 218 10.3 TUTTE'S THEOREM
220 10.4 EAR-DECOMPOSITIONS OF FACTOR-CRITICAL GRAPHS 223 10.5 EDMONDS'
MATCHING ALGORITHM 229 EXERCISES 238 REFERENCES 242 11. WEIGHTED
MATCHING 245 11.1 THE ASSIGNMENT PROBLEM 246 11.2 OUTLINE OF THE
WEIGHTED MATCHING ALGORITHM 247 11.3 IMPLEMENTATION OF THE WEIGHTED
MATCHING ALGORITHM 250 11.4 POSTOPTIMALITY 263 11.5 THE MATCHING
POLYTOPE 264 EXERCISES 267 REFERENCES 269 12. 6-MATCHINGS AND T-JOINS
271 12.1 FC-MATCHINGS 271 12.2 MINIMUM WEIGHT R -JOINS 275 12.3 T-JOINS
AND T-CUTS 279 12.4 THE PADBERG-RAO THEOREM 282 EXERCISES 285 REFERENCES
288 13. MATROIDS 291 13.1 INDEPENDENCE SYSTEMS AND MATROIDS 291 13.2
OTHER MATROID AXIOMS 295 13.3 DUALITY 299 13.4 THE GREEDY ALGORITHM 303
13.5 MATROID INTERSECTION 308 13.6 MATROID PARTITIONING 313 13.7
WEIGHTED MATROID INTERSECTION 314 EXERCISES 318 REFERENCES 320 14.
GENERALIZATIONS OF MATROIDS 323 14.1 GREEDOIDS 323 14.2 POLYMATROIDS 327
14.3 MINIMIZING SUBMODULAR FUNCTIONS 331 14.4 SCHRIJVER'S ALGORITHM 333
14.5 SYMMETRIC SUBMODULAR FUNCTIONS 337 EXERCISES 339 REFERENCES 341 XIV
TABLE OF CONTENTS 15. NP -COMPLETENESS 343 15.1 TURING MACHINES 343 15.2
CHURCH'S THESIS 345 15.3 P AND JVP 350 15.4 COOK'S THEOREM 354 15.5 SOME
BASIC NP -COMPLETE PROBLEMS 358 15.6 THE CLASS CONP 365 15.7 M -HARD
PROBLEMS 367 EXERCISES 371 REFERENCES 374 16. APPROXIMATION ALGORITHMS
377 16.1 SET COVERING 378 16.2 COLOURING 383 16.3 APPROXIMATION SCHEMES
390 16.4 MAXIMUM SATISFIABILITY 392 16.5 THE PCP THEOREM 397 16.6
L-REDUCTIONS 401 EXERCISES 407 REFERENCES 410 17. THE KNAPSACK PROBLEM
415 17.1 FRACTIONAL KNAPSACK AND WEIGHTED MEDIAN PROBLEM 415 17.2 A
PSEUDOPOLYNOMIAL ALGORITHM 418 17.3 A FULLY POLYNOMIAL APPROXIMATION
SCHEME 420 EXERCISES 422 REFERENCES 423 18. BIN-PACKING 425 18.1 GREEDY
HEURISTICS 425 18.2 AN ASYMPTOTIC APPROXIMATION SCHEME 431 18.3 THE
KARMARKAR-KARP ALGORITHM 435 EXERCISES 438 REFERENCES 439 19.
MULTICOMMODITY FLOWS AND EDGE-DISJOINT PATHS 443 19.1 MULTICOMMODITY
FLOWS 444 19.2 ALGORITHMS FOR MULTICOMMODITY FLOWS 447 19.3 DIRECTED
EDGE-DISJOINT PATHS PROBLEM 451 19.4 UNDIRECTED EDGE-DISJOINT PATHS
PROBLEM 455 EXERCISES 460 REFERENCES 463 TABLE OF CONTENTS XV 20.
NETWORK DESIGN PROBLEMS 467 20.1 STEINER TREES 468 20.2 THE
ROBINS-ZELIKOVSKY ALGORITHM 473 20.3 SURVIVABLE NETWORK DESIGN 478 20.4
A PRIMAL-DUAL APPROXIMATION ALGORITHM 481 20.5 JAIN'S ALGORITHM 489
EXERCISES 495 REFERENCES 498 21. THE TRAVELING SALESMAN PROBLEM 501 21.1
APPROXIMATION ALGORITHMS FOR THE TSP 501 21.2 EUCLIDEAN TSPS 506 21.3
LOCAL SEARCH 513 21.4 THE TRAVELING SALESMAN POLYTOPE 519 21.5 LOWER
BOUNDS 525 21.6 BRANCH-AND-BOUND 527 EXERCISES 530 REFERENCES 532 22.
FACILITY LOCATION 537 22.1 THE UNCAPACITATED FACILITY LOCATION PROBLEM
537 22.2 ROUNDING LINEAR PROGRAMMING SOLUTIONS 539 22.3 PRIMAL-DUAL
ALGORITHMS 541 22.4 SCALING AND GREEDY AUGMENTATION 547 22.5 BOUNDING
THE NUMBER OF FACILITIES 550 22.6 LOCAL SEARCH 553 22.7 CAPACITATED
FACILITY LOCATION PROBLEMS 559 22.8 UNIVERSAL FACILITY LOCATION 561
EXERCISES 568 REFERENCES 570 NOTATION INDEX 573 AUTHOR INDEX 577 SUBJECT
INDEX 585 |
| any_adam_object | 1 |
| author | Korte, Bernhard Vygen, Jens 1967- |
| author_GND | (DE-588)14204086X |
| author_facet | Korte, Bernhard Vygen, Jens 1967- |
| author_role | aut aut |
| author_sort | Korte, Bernhard |
| author_variant | b k bk j v jv |
| building | Verbundindex |
| bvnumber | BV020040983 |
| classification_rvk | SK 890 |
| classification_tum | MAT 913f |
| ctrlnum | (OCoLC)254652176 (DE-599)BVBBV020040983 |
| dewey-full | 519.64 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.64 |
| dewey-search | 519.64 |
| dewey-sort | 3519.64 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 3. ed. |
| 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">BV020040983</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060503</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">050922s2006 ad|| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540256849</subfield><subfield code="9">3-540-25684-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540256847</subfield><subfield code="9">978-3-540-25684-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)254652176</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV020040983</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><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.64</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68R10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C27</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65K05</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Korte, Bernhard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial optimization</subfield><subfield code="b">theory and algorithms</subfield><subfield code="c">Bernhard Korte ; Jens Vygen</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 597 S.</subfield><subfield code="b">Ill., 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">Algorithms and combinatorics</subfield><subfield code="v">21</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Kombinatorische Optimierung - Lehrbuch</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="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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vygen, Jens</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)14204086X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Algorithms and combinatorics</subfield><subfield code="v">21</subfield><subfield code="w">(DE-604)BV000617357</subfield><subfield code="9">21</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Darmstadt</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013362065&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield></record></collection> |
| id | DE-604.BV020040983 |
| illustrated | Illustrated |
| indexdate | 2024-07-20T07:20:20Z |
| institution | BVB |
| isbn | 3540256849 9783540256847 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-013362065 |
| oclc_num | 254652176 |
| open_access_boolean | |
| owner | DE-703 DE-29T DE-91G DE-BY-TUM DE-83 DE-11 DE-188 |
| owner_facet | DE-703 DE-29T DE-91G DE-BY-TUM DE-83 DE-11 DE-188 |
| physical | XV, 597 S. Ill., graph. Darst. |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Springer |
| record_format | marc |
| series | Algorithms and combinatorics |
| series2 | Algorithms and combinatorics |
| spelling | Korte, Bernhard Verfasser aut Combinatorial optimization theory and algorithms Bernhard Korte ; Jens Vygen 3. ed. Berlin [u.a.] Springer 2006 XV, 597 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algorithms and combinatorics 21 Kombinatorische Optimierung - Lehrbuch Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 s DE-604 Vygen, Jens 1967- Verfasser (DE-588)14204086X aut Algorithms and combinatorics 21 (DE-604)BV000617357 21 HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013362065&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Korte, Bernhard Vygen, Jens 1967- Combinatorial optimization theory and algorithms Algorithms and combinatorics Kombinatorische Optimierung - Lehrbuch Kombinatorische Optimierung (DE-588)4031826-6 gnd |
| subject_GND | (DE-588)4031826-6 |
| title | Combinatorial optimization theory and algorithms |
| title_auth | Combinatorial optimization theory and algorithms |
| title_exact_search | Combinatorial optimization theory and algorithms |
| title_full | Combinatorial optimization theory and algorithms Bernhard Korte ; Jens Vygen |
| title_fullStr | Combinatorial optimization theory and algorithms Bernhard Korte ; Jens Vygen |
| title_full_unstemmed | Combinatorial optimization theory and algorithms Bernhard Korte ; Jens Vygen |
| title_short | Combinatorial optimization |
| title_sort | combinatorial optimization theory and algorithms |
| title_sub | theory and algorithms |
| topic | Kombinatorische Optimierung - Lehrbuch Kombinatorische Optimierung (DE-588)4031826-6 gnd |
| topic_facet | Kombinatorische Optimierung - Lehrbuch Kombinatorische Optimierung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013362065&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000617357 |
| work_keys_str_mv | AT kortebernhard combinatorialoptimizationtheoryandalgorithms AT vygenjens combinatorialoptimizationtheoryandalgorithms |