A First Course in Combinatorial Optimization / Edition 1

A First Course in Combinatorial Optimization / Edition 1

by Jon Lee
     
 

ISBN-10: 0521010128

ISBN-13: 9780521010122

Pub. Date: 02/28/2004

Publisher: Cambridge University Press

For advanced undergraduate or graduate level students with some elementary notions from graph theory, this text is intended as a rigorous, enticing introduction to be used in a one-semester course. Without attempting comprehensiveness and touching only lightly on applications, Lee (IBM T.J. Watson Research Center) discusses linear and integer programming, polytopes,

Overview

For advanced undergraduate or graduate level students with some elementary notions from graph theory, this text is intended as a rigorous, enticing introduction to be used in a one-semester course. Without attempting comprehensiveness and touching only lightly on applications, Lee (IBM T.J. Watson Research Center) discusses linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. He emphasizes the unifying roles of matroids, submodularity, and polyhedral combinatorics, and does not dwell on data structures and implementation details. Problems and exercises are included throughout. Annotation ©2005 Book News, Inc., Portland, OR

Product Details

ISBN-13:
9780521010122
Publisher:
Cambridge University Press
Publication date:
02/28/2004
Series:
Cambridge Texts in Applied Mathematics Series, #36
Edition description:
New Edition
Pages:
228
Product dimensions:
5.98(w) x 8.98(h) x 0.51(d)

Table of Contents

Introduction; Polytopes and linear programming; 1. Matroids and the greedy algorithm; 2. Minimum-weight dipaths; 3. Matroid intersection; 4. Matching; 5. Flows and cuts; 6. Cutting planes; 7. Branch-&-bound; 8. Optimizing submodular functions; Appendix.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >