Combinatorial optimization: theory and algorithms
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg
Springer
2012
|
| Ausgabe: | 5. ed. |
| Schriftenreihe: | Algorithms and combinatorics
21 |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | XIX, 659 S. graph. Darst. 25 cm |
| ISBN: | 9783642244872 3642244874 9783642244889 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV039984163 | ||
| 003 | DE-604 | ||
| 005 | 20131015 | ||
| 007 | t | ||
| 008 | 120327s2012 d||| |||| 00||| eng d | ||
| 015 | |a 11,N46 |2 dnb | ||
| 015 | |a 12,A07 |2 dnb | ||
| 016 | 7 | |a 1016843828 |2 DE-101 | |
| 020 | |a 9783642244872 |c Pp. : EUR 69.50 (DE, freier Pr.), EUR 71.50 (AT, freier Pr.), sfr 86.50 (freier Pr.) |9 978-3-642-24487-2 | ||
| 020 | |a 3642244874 |9 3-642-24487-4 | ||
| 020 | |a 9783642244889 |9 978-3-642-24488-9 | ||
| 024 | 3 | |a 9783642244872 | |
| 028 | 5 | 2 | |a Best.-Nr.: 80073772 |
| 035 | |a (OCoLC)778379629 | ||
| 035 | |a (DE-599)DNB1016843828 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G |a DE-83 |a DE-19 |a DE-11 |a DE-384 |a DE-91 |a DE-188 | ||
| 082 | 0 | |a 519.64 |2 22/ger | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 913f |2 stub | ||
| 084 | |a 68R10 |2 msc | ||
| 084 | |a 90C27 |2 msc | ||
| 084 | |a 05C85 |2 msc | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a 65K05 |2 msc | ||
| 100 | 1 | |a Korte, Bernhard |d 1938- |e Verfasser |0 (DE-588)139321802 |4 aut | |
| 245 | 1 | 0 | |a Combinatorial optimization |b theory and algorithms |c Bernhard Korte ; Jens Vygen |
| 250 | |a 5. ed. | ||
| 264 | 1 | |a Berlin ; Heidelberg |b Springer |c 2012 | |
| 300 | |a XIX, 659 S. |b graph. Darst. |c 25 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Algorithms and combinatorics |v 21 | |
| 500 | |a Literaturangaben | ||
| 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 X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3905406&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024841449&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024841449 | |
Datensatz im Suchindex
| _version_ | 1805146379297751040 |
|---|---|
| adam_text |
IMAGE 1
TABLE OF CONTENTS
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
GRAPHS 13
2.1 BASIC DEFINITIONS 13
2.2 TREES, CIRCUITS, AND CUTS 17
2.3 CONNECTIVITY 24
2.4 EULERIAN AND BIPARTITE GRAPHS 31
2.5 PLANARITY 34
2.6 PLANAR DUALITY 41
EXERCISES 43
REFERENCES 47
LINEAR PROGRAMMING 51
3.1 POLYHEDRA 52
3.2 THE SIMPLEX ALGORITHM 56
3.3 IMPLEMENTATION OF THE SIMPLEX ALGORITHM 60
3.4 DUALITY 63
3.5 CONVEX HULLS AND POLYTOPES 67
EXERCISES 68
REFERENCES 70
LINEAR PROGRAMMING ALGORITHMS 73
4.1 SIZE OF VERTICES AND FACES 73
4.2 CONTINUED FRACTIONS 76
4.3 GAUSSIAN ELIMINATION 79
4.4 THE ELLIPSOID METHOD 82
4.5 KHACHIYAN'S THEOREM 88
4.6 SEPARATION AND OPTIMIZATION 90
EXERCISES 97
REFERENCES 99
XV
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1016843828
DIGITALISIERT DURCH
IMAGE 2
XVI TABLE OF CONTENTS
5 INTEGER PROGRAMMING 101
5.1 THE INTEGER HULL OF A POLYHEDRON 103
5.2 UNIMODULAR TRANSFORMATIONS 107
5.3 TOTAL DUAL INTEGRALITY 109
5.4 TOTALLY UNIMODULAR MATRICES 112
5.5 CUTTING PLANES 117
5.6 LAGRANGEAN RELAXATION 121
EXERCISES 123
REFERENCES 127
6 SPANNING TREES AND ARBORESCENCES 131
6.1 MINIMUM SPANNING TREES 131
6.2 MINIMUM WEIGHT ARBORESCENCES 138
6.3 POLYHEDRAL DESCRIPTIONS 142
6.4 PACKING SPANNING TREES AND ARBORESCENCES 145
EXERCISES 148
REFERENCES 153
7 SHORTEST PATHS 157
7.1 SHORTEST PATHS FROM ONE SOURCE 158
7.2 SHORTEST PATHS BETWEEN ALL PAIRS OF VERTICES 162
7.3 MINIMUM MEAN CYCLES 165
EXERCISES 167
REFERENCES 169
8 NETWORK FLOWS 173
8.1 MAX-FLOW-MIN-CUT THEOREM 174
8.2 MENGER'S THEOREM 178
8.3 THE EDMONDS-KARP ALGORITHM 180
8.4 DINIC'S, KARZANOV'S, AND FUJISHIGE'S ALGORITHM 182
8.5 THE GOLDBERG-TARJAN ALGORITHM 186
8.6 GOMORY-HU TREES 190
8.7 THE MINIMUM CAPACITY OF A CUT IN AN UNDIRECTED GRAPH 196 EXERCISES
199
REFERENCES 205
9 MINIMUM COST FLOWS 211
9.1 PROBLEM FORMULATION 211
9.2 AN OPTIMALITY CRITERION 214
9.3 MINIMUM MEAN CYCLE-CANCELLING ALGORITHM 216
9.4 SUCCESSIVE SHORTEST PATH ALGORITHM 219
9.5 ORLIN'S ALGORITHM 223
9.6 THE NETWORK SIMPLEX ALGORITHM 227
9.7 FLOWS OVER TIME 231
EXERCISES 233
REFERENCES 237
IMAGE 3
TABLE OF CONTENTS XVII
10 MAXIMUM MATCHINGS 241
10.1 BIPARTITE MATCHING 242
10.2 THE TUTTE MATRIX 244
10.3 TUTTE'S THEOREM 246
10.4 EAR-DECOMPOSITIONS OF FACTOR-CRITICAL GRAPHS 249
10.5 EDMONDS' MATCHING ALGORITHM 255
EXERCISES 264
REFERENCES 268
11 WEIGHTED MATCHING 273
11.1 THE ASSIGNMENT PROBLEM 274
11.2 OUTLINE OF THE WEIGHTED MATCHING ALGORITHM 276
11.3 IMPLEMENTATION OF THE WEIGHTED MATCHING ALGORITHM 279 11.4
POSTOPTIMALITY 292
11.5 THE MATCHING POLYTOPE 293
EXERCISES 296
REFERENCES 298
12 O-MATCHINGS AND 7-JOINS 301
12.1 E-MATCHINGS 301
12.2 MINIMUM WEIGHT 7/-JOINS 305
12.3 R-JOINS AND 7/-CUTS 309
12.4 THE PADBERG-RAO THEOREM 313
EXERCISES 315
REFERENCES 318
13 MATROIDS 321
13.1 INDEPENDENCE SYSTEMS AND MATROIDS 321
13.2 OTHER MATROID AXIOMS 325
13.3 DUALITY 329
13.4 THE GREEDY ALGORITHM 333
13.5 MATROID INTERSECTION 338
13.6 MATROID PARTITIONING 343
13.7 WEIGHTED MATROID INTERSECTION 345
EXERCISES 349
REFERENCES 351
14 GENERALIZATIONS OF MATROIDS 355
14.1 GREEDOIDS 355
14.2 POLYMATROIDS 359
14.3 MINIMIZING SUBMODULAR FUNCTIONS 363
14.4 SCHRIJVER'S ALGORITHM 365
14.5 SYMMETRIC SUBMODULAR FUNCTIONS 369
EXERCISES 371
REFERENCES 374
IMAGE 4
XVIII TABLE OF CONTENTS
15 AT-COMPLETENESS 377
15.1 TURING MACHINES 377
15.2 CHURCH'S THESIS 380
15.3 F AND AFP 385
15.4 COOK'S THEOREM 389
15.5 SOME BASIC NP-COMPLETE PROBLEMS 392
15.6 THE CLASS CONP 400
15.7 ATP-HARD PROBLEMS 402
EXERCISES 406
REFERENCES 410
16 APPROXIMATION ALGORITHMS 413
16.1 SET COVERING 414
16.2 THE MAX-CUT PROBLEM 419
16.3 COLOURING 425
16.4 APPROXIMATION SCHEMES 433
16.5 MAXIMUM SATISFIABILITY 435
16.6 THEPCPTHEOREM 440
16.7 L-REDUCTIONS 444
EXERCISES 450
REFERENCES 454
17 THE KNAPSACK PROBLEM 459
17.1 FRACTIONAL KNAPSACK AND WEIGHTED MEDIAN PROBLEM 459 17.2 A
PSEUDOPOLYNOMIAL ALGORITHM 462
17.3 A FULLY POLYNOMIAL APPROXIMATION SCHEME 464
17.4 MULTI-DIMENSIONAL KNAPSACK 467
EXERCISES 468
REFERENCES 469
18 BIN-PACKING 471
18.1 GREEDY HEURISTICS 471
18.2 AN ASYMPTOTIC APPROXIMATION SCHEME 477
18.3 THE KARMARKAR-KARP ALGORITHM 481
EXERCISES 484
REFERENCES 486
19 MULTICOMMODITY FLOWS AND EDGE-DISJOINT PATHS 489
19.1 MULTICOMMODITY FLOWS 490
19.2 ALGORITHMS FOR MULTICOMMODITY FLOWS 494
19.3 SPARSEST CUT AND MAX-FLOW MIN-CUT RATIO 499
19.4 THE LEIGHTON-RAO THEOREM 500
19.5 DIRECTED EDGE-DISJOINT PATHS PROBLEM 503
19.6 UNDIRECTED EDGE-DISJOINT PATHS PROBLEM 507
EXERCISES 513
REFERENCES 517
IMAGE 5
TABLE OF CONTENTS XIX
20 NETWORK DESIGN PROBLEMS 521
20.1 STEINER TREES 522
20.2 THE ROBINS-ZELIKOVSKY ALGORITHM 527
20.3 SURVIVABLE NETWORK DESIGN 532
20.4 A PRIMAL-DUAL APPROXIMATION ALGORITHM 536
20.5 JAIN'S ALGORITHM 544
EXERCISES 550
REFERENCES 553
21 THE TRAVELING SALESMAN PROBLEM 557
21.1 APPROXIMATION ALGORITHMS FOR THE TSP 557
21.2 EUCLIDEAN TSP 562
21.3 LOCAL SEARCH 569
21.4 THE TRAVELING SALESMAN POLYTOPE 575
21.5 LOWER BOUNDS 581
21.6 BRANCH-AND-BOUND 584
EXERCISES 586
REFERENCES 589
22 FACILITY LOCATION 593
22.1 THE UNCAPACITATED FACILITY LOCATION PROBLEM 593
22.2 ROUNDING LINEAR PROGRAMMING SOLUTIONS 595
22.3 PRIMAL-DUAL ALGORITHMS 597
22.4 SCALING AND GREEDY AUGMENTATION 603
22.5 BOUNDING THE NUMBER OF FACILITIES 606
22.6 LOCAL SEARCH 609
22.7 CAPACITATED FACILITY LOCATION PROBLEMS 615
22.8 UNIVERSAL FACILITY LOCATION 618
EXERCISES 624
REFERENCES 626
NOTATION INDEX 629
AUTHOR INDEX 633
SUBJECT INDEX 645 |
| any_adam_object | 1 |
| author | Korte, Bernhard 1938- Vygen, Jens 1967- |
| author_GND | (DE-588)139321802 (DE-588)14204086X |
| author_facet | Korte, Bernhard 1938- Vygen, Jens 1967- |
| author_role | aut aut |
| author_sort | Korte, Bernhard 1938- |
| author_variant | b k bk j v jv |
| building | Verbundindex |
| bvnumber | BV039984163 |
| classification_rvk | SK 890 |
| classification_tum | MAT 913f |
| ctrlnum | (OCoLC)778379629 (DE-599)DNB1016843828 |
| 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 | 5. 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">BV039984163</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20131015</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120327s2012 d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">11,N46</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,A07</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1016843828</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642244872</subfield><subfield code="c">Pp. : EUR 69.50 (DE, freier Pr.), EUR 71.50 (AT, freier Pr.), sfr 86.50 (freier Pr.)</subfield><subfield code="9">978-3-642-24487-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642244874</subfield><subfield code="9">3-642-24487-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642244889</subfield><subfield code="9">978-3-642-24488-9</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642244872</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 80073772</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)778379629</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1016843828</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-29T</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.64</subfield><subfield code="2">22/ger</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">90C27</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05C85</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</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="d">1938-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)139321802</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">5. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 659 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">25 cm</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="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</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">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3905406&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</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=024841449&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024841449</subfield></datafield></record></collection> |
| id | DE-604.BV039984163 |
| illustrated | Illustrated |
| indexdate | 2024-07-21T00:28:59Z |
| institution | BVB |
| isbn | 9783642244872 3642244874 9783642244889 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024841449 |
| oclc_num | 778379629 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM DE-83 DE-19 DE-BY-UBM DE-11 DE-384 DE-91 DE-BY-TUM DE-188 |
| owner_facet | DE-29T DE-91G DE-BY-TUM DE-83 DE-19 DE-BY-UBM DE-11 DE-384 DE-91 DE-BY-TUM DE-188 |
| physical | XIX, 659 S. graph. Darst. 25 cm |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Springer |
| record_format | marc |
| series | Algorithms and combinatorics |
| series2 | Algorithms and combinatorics |
| spelling | Korte, Bernhard 1938- Verfasser (DE-588)139321802 aut Combinatorial optimization theory and algorithms Bernhard Korte ; Jens Vygen 5. ed. Berlin ; Heidelberg Springer 2012 XIX, 659 S. graph. Darst. 25 cm txt rdacontent n rdamedia nc rdacarrier Algorithms and combinatorics 21 Literaturangaben 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 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3905406&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024841449&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Korte, Bernhard 1938- Vygen, Jens 1967- Combinatorial optimization theory and algorithms Algorithms and combinatorics 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 (DE-588)4031826-6 gnd |
| topic_facet | Kombinatorische Optimierung |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3905406&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024841449&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 |