A first course in combinatorial optimization:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2004
|
Ausgabe: | 1. publ. |
Schriftenreihe: | Cambridge texts in applied mathematics
36 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Hier auch spätere, unveränderte Nachdrucke |
Beschreibung: | XVI, 211 S. graph. Darst. |
ISBN: | 0521811511 0521010128 |
Internformat
MARC
LEADER | 00000nam a2200000zcb4500 | ||
---|---|---|---|
001 | BV017809723 | ||
003 | DE-604 | ||
005 | 20160112 | ||
007 | t | ||
008 | 040127s2004 xxkd||| |||| 00||| eng d | ||
010 | |a 2004040681 | ||
020 | |a 0521811511 |9 0-521-81151-1 | ||
020 | |a 0521010128 |9 0-521-01012-8 | ||
035 | |a (OCoLC)54007183 | ||
035 | |a (DE-599)BVBBV017809723 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
044 | |a xxk |c GB | ||
049 | |a DE-703 |a DE-91G |a DE-634 |a DE-83 |a DE-91 |a DE-384 | ||
050 | 0 | |a QA402.5 | |
082 | 0 | |a 519.6/4 |2 22 | |
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
084 | |a MAT 913f |2 stub | ||
084 | |a 90C27 |2 msc | ||
100 | 1 | |a Lee, Jon |e Verfasser |4 aut | |
245 | 1 | 0 | |a A first course in combinatorial optimization |c Jon Lee |
250 | |a 1. publ. | ||
264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2004 | |
300 | |a XVI, 211 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Cambridge texts in applied mathematics |v 36 | |
500 | |a Hier auch spätere, unveränderte Nachdrucke | ||
650 | 7 | |a Combinatieleer |2 gtt | |
650 | 7 | |a Combinatória |2 larpcal | |
650 | 7 | |a Matroiden |2 gtt | |
650 | 7 | |a Optimaliseren |2 gtt | |
650 | 4 | |a Optimisation combinatoire | |
650 | 7 | |a Otimização combinatória |2 larpcal | |
650 | 4 | |a Combinatorial optimization | |
650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Ganzzahlige Optimierung |0 (DE-588)4155950-2 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
689 | 0 | 1 | |a Ganzzahlige Optimierung |0 (DE-588)4155950-2 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
830 | 0 | |a Cambridge texts in applied mathematics |v 36 |w (DE-604)BV005466119 |9 36 | |
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=010692895&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-010692895 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804130504668086272 |
---|---|
adam_text | A FIRST COURSE IN COMBINATORIAL OPTIMIZATION JON LEE IBM T.J. WATSON
RESEARCH CENTER, YORKTOWN HEIGHTS, NEW YORK CAMBRIDGE UNIVERSITY PRESS
CONTENTS PREFACE INTRODUCTION 0 POLYTOPES AND LINEAR PROGRAMMING 0.1
FINITE SYSTEMS OF LINEAR INEQUALITIES 0.2 LINEAR-PROGRAMMING DUALITY 0.3
BASIC SOLUTIONS AND THE PRIMAL SIMPLEX METHOD 0.4 SENSITIVITY ANALYSIS
0.5 POLYTOPES 0.6 LAGRANGIAN RELAXATION 0.7 THE DUAL SIMPLEX METHOD 0.8
TOTALLY UNIMODULAR MATRICES, GRAPHS, AND DIGRAPHS 0.9 FURTHER STUDY 1
MATROIDS AND THE GREEDY ALGORITHM 1.1 INDEPENDENCE AXIOMS AND EXAMPLES
OF MATROIDS 1.2 CIRCUIT PROPERTIES 1.3 REPRESENTATIONS 1.4 THE GREEDY
ALGORITHM 1.5 RANK PROPERTIES 1.6 DUALITY 1.7 THE MATROID POLY TOPE 1.8
FURTHER STUDY 2 MINIMUM-WEIGHT DIPATHS 2.1 NO NEGATIVE-WEIGHT CYCLES 2.2
ALL-PAIRS MINIMUM-WEIGHT DIOATHS PAGE XIII 1 9 9 14 21 27 29 35 40 41 47
49 49 51 53 56 60 63 66 73 75 76 78 IX X CONTENTS 2.3 NONNEGATIVE
WEIGHTS 78 2.4 NO DICYCLES AND KNAPSACK PROGRAMS 81 2.5 FURTHER STUDY 82
3 MATROID INTERSECTION 84 3.1 APPLICATIONS *** 84 3.2 AN EFFICIENT
CARDINALITY MATROID-INTERSECTION ALGORITHM AND CONSEQUENCES 89 3.3 AN
EFFICIENT MAXIMUM-WEIGHT MATROID-INTERSECTION ALGORITHM 101 3.4 THE
MATROID-INTERSECTION POLY TOPE 103 3.5 FURTHER STUDY 106 4 MATCHING 107
4.1 AUGMENTING PATHS AND MATROIDS 107 4.2 THE MATCHING POLYTOPE 109 4.3
DUALITY AND A MAXIMUM-CARDINALITY MATCHING ALGORITHM 113 4.4 KUHN S
ALGORITHM FOR THE ASSIGNMENT PROBLEM 121 4.5 APPLICATIONS OF WEIGHTED
MATCHING 126 4.6 FURTHER STUDY 137 5 FLOWS AND CUTS 138 5.1 SOURCE-SINK
FLOWS AND CUTS 138 5.2 AN EFFICIENT MAXIMUM-FLOW ALGORITHM AND
CONSEQUENCES 140 5.3 UNDIRECTED CUTS 147 5.4 FURTHER STUDY 150 6 CUTTING
PLANES 151 6.1 GENERIC CUTTING-PLANE METHOD 151 6.2 CHVATAL-GOMORY
CUTTING PLANES - 152 6.3 GOMORY CUTTING PLANES . 156 6.4 TIGHTENING A
CONSTRAINT 167 6.5 CONSTRAINT GENERATION FOR COMBINATORIAL-OPTIMIZATION
PROBLEMS 171 6.6 FURTHER STUDY 176 7 BRANCH-&-BOUND 177 7.1
BRANCH-&-BOUND USING LINEAR-PROGRAMMING RELAXATION 179 7.2 KNAPSACK
PROGRAMS AND GROUP RELAXATION 184 7.3 BRANCH-&-BOUND FOR OPTIMAL-WEIGHT
HAMILTONIAN TOUR 188 CONTENTS XI 7.4 MAXIMUM-ENTROPY SAMPLING AND
BRANCH-&-BOUND 191 7.5 FURTHER STUDY 193 8 OPTIMIZING SUBMODULAR
FUNCTIONS 194 8.1 MINIMIZING SUBMODULAR FUNCTIONS 194 8.2 MINIMIZING
SUBMODULAR FUNCTIONS OVER ODD SETS 197 8.3 MAXIMIZING SUBMODULAR
FUNCTIONS 200 8.4 FURTHER STUDY 201 APPENDIX: NOTATION AND TERMINOLOGY
203 A.I SETS 203 A.2 ALGEBRA 203 A.3 GRAPHS 204 A.4 DIGRAPHS 205
REFERENCES 207 BACKGROUND READING 207 FURTHER READING 207 INDEXES 209
EXAMPLES 209 EXERCISES 209 PROBLEMS 209 RESULTS 210 ALGORITHMS 211
|
any_adam_object | 1 |
author | Lee, Jon |
author_facet | Lee, Jon |
author_role | aut |
author_sort | Lee, Jon |
author_variant | j l jl |
building | Verbundindex |
bvnumber | BV017809723 |
callnumber-first | Q - Science |
callnumber-label | QA402 |
callnumber-raw | QA402.5 |
callnumber-search | QA402.5 |
callnumber-sort | QA 3402.5 |
callnumber-subject | QA - Mathematics |
classification_rvk | SK 890 |
classification_tum | MAT 913f |
ctrlnum | (OCoLC)54007183 (DE-599)BVBBV017809723 |
dewey-full | 519.6/4 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.6/4 |
dewey-search | 519.6/4 |
dewey-sort | 3519.6 14 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
edition | 1. publ. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02223nam a2200577zcb4500</leader><controlfield tag="001">BV017809723</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160112 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">040127s2004 xxkd||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2004040681</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521811511</subfield><subfield code="9">0-521-81151-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521010128</subfield><subfield code="9">0-521-01012-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)54007183</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017809723</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="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA402.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.6/4</subfield><subfield code="2">22</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">90C27</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lee, Jon</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A first course in combinatorial optimization</subfield><subfield code="c">Jon Lee</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 211 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">Cambridge texts in applied mathematics</subfield><subfield code="v">36</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Hier auch spätere, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatieleer</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatória</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matroiden</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimaliseren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimisation combinatoire</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Otimização combinatória</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</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">Ganzzahlige Optimierung</subfield><subfield code="0">(DE-588)4155950-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</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">Ganzzahlige Optimierung</subfield><subfield code="0">(DE-588)4155950-2</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="830" ind1=" " ind2="0"><subfield code="a">Cambridge texts in applied mathematics</subfield><subfield code="v">36</subfield><subfield code="w">(DE-604)BV005466119</subfield><subfield code="9">36</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=010692895&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010692895</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></record></collection> |
genre | (DE-588)4151278-9 Einführung gnd-content |
genre_facet | Einführung |
id | DE-604.BV017809723 |
illustrated | Illustrated |
indexdate | 2024-07-09T19:22:05Z |
institution | BVB |
isbn | 0521811511 0521010128 |
language | English |
lccn | 2004040681 |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010692895 |
oclc_num | 54007183 |
open_access_boolean | |
owner | DE-703 DE-91G DE-BY-TUM DE-634 DE-83 DE-91 DE-BY-TUM DE-384 |
owner_facet | DE-703 DE-91G DE-BY-TUM DE-634 DE-83 DE-91 DE-BY-TUM DE-384 |
physical | XVI, 211 S. graph. Darst. |
publishDate | 2004 |
publishDateSearch | 2004 |
publishDateSort | 2004 |
publisher | Cambridge Univ. Press |
record_format | marc |
series | Cambridge texts in applied mathematics |
series2 | Cambridge texts in applied mathematics |
spelling | Lee, Jon Verfasser aut A first course in combinatorial optimization Jon Lee 1. publ. Cambridge [u.a.] Cambridge Univ. Press 2004 XVI, 211 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Cambridge texts in applied mathematics 36 Hier auch spätere, unveränderte Nachdrucke Combinatieleer gtt Combinatória larpcal Matroiden gtt Optimaliseren gtt Optimisation combinatoire Otimização combinatória larpcal Combinatorial optimization Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Ganzzahlige Optimierung (DE-588)4155950-2 gnd rswk-swf (DE-588)4151278-9 Einführung gnd-content Kombinatorische Optimierung (DE-588)4031826-6 s Ganzzahlige Optimierung (DE-588)4155950-2 s 1\p DE-604 Cambridge texts in applied mathematics 36 (DE-604)BV005466119 36 HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010692895&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Lee, Jon A first course in combinatorial optimization Cambridge texts in applied mathematics Combinatieleer gtt Combinatória larpcal Matroiden gtt Optimaliseren gtt Optimisation combinatoire Otimização combinatória larpcal Combinatorial optimization Kombinatorische Optimierung (DE-588)4031826-6 gnd Ganzzahlige Optimierung (DE-588)4155950-2 gnd |
subject_GND | (DE-588)4031826-6 (DE-588)4155950-2 (DE-588)4151278-9 |
title | A first course in combinatorial optimization |
title_auth | A first course in combinatorial optimization |
title_exact_search | A first course in combinatorial optimization |
title_full | A first course in combinatorial optimization Jon Lee |
title_fullStr | A first course in combinatorial optimization Jon Lee |
title_full_unstemmed | A first course in combinatorial optimization Jon Lee |
title_short | A first course in combinatorial optimization |
title_sort | a first course in combinatorial optimization |
topic | Combinatieleer gtt Combinatória larpcal Matroiden gtt Optimaliseren gtt Optimisation combinatoire Otimização combinatória larpcal Combinatorial optimization Kombinatorische Optimierung (DE-588)4031826-6 gnd Ganzzahlige Optimierung (DE-588)4155950-2 gnd |
topic_facet | Combinatieleer Combinatória Matroiden Optimaliseren Optimisation combinatoire Otimização combinatória Combinatorial optimization Kombinatorische Optimierung Ganzzahlige Optimierung Einführung |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010692895&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV005466119 |
work_keys_str_mv | AT leejon afirstcourseincombinatorialoptimization |