A First Course in Combinatorial Optimization

Front Cover
Cambridge University Press, Feb 9, 2004 - Business & Economics - 211 pages
0 Reviews
"A First Course in Combinatorial Optimization" is a self-contained text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. The author focuses on the key mathematical ideas that lead to useful models and algorithms rather than on data structures and implementation details. The viewpoint is polyhedral, and the author also uses matroids as a unifying idea.Topics include linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Problems and exercises are included throughout as well as references for further study.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

II
1
III
9
IV
14
V
21
VI
27
VII
29
VIII
35
IX
40
XXXVI
126
XXXVII
137
XXXVIII
138
XL
140
XLI
147
XLII
150
XLIII
151
XLV
152

X
49
XII
51
XIII
53
XIV
56
XV
60
XVI
63
XVII
66
XVIII
73
XIX
75
XX
76
XXI
78
XXIII
81
XXIV
82
XXV
84
XXVII
89
XXVIII
101
XXIX
103
XXX
106
XXXI
107
XXXIII
109
XXXIV
113
XXXV
121
XLVI
156
XLVII
167
XLVIII
171
XLIX
176
L
177
LI
179
LII
184
LIII
188
LIV
191
LV
193
LVI
194
LVII
197
LVIII
200
LIX
201
LX
203
LXIII
204
LXIV
205
LXV
207
LXVI
209
LXVII
210
LXVIII
211
Copyright

Other editions - View all

Common terms and phrases

References to this book

Bibliographic information