A First Course in Combinatorial Optimization

Jon Lee - Collection Cambridge Texts in Applied Mathematics

210 pages, parution le 29/03/2004

Ajouter à une liste

Indisponible

Résumé

A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids.
The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

L'auteur - Jon Lee

Jon Lee: IBM T.J. Watson Research Center, Yorktown Heights, New York

Sommaire

Introduction
Polytopes and linear programming
Matroids and the greedy algorithm
Minimum-weight dipaths
Matroid intersection
Matching
Flows and cuts
Cutting planes
Branch-&-bound
Optimizing submodular functions
Appendix

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Cambridge University Press
Auteur(s)	Jon Lee
Collection	Cambridge Texts in Applied Mathematics
Parution	29/03/2004
Nb. de pages	210
Format	15 x 23
Couverture	Broché
Poids	315g
Intérieur	Noir et Blanc
EAN13	9780521010122
ISBN13	978-0-521-01012-2