A first course in combinatorial optimization

Main
Mathematics - Optimization. Operations Research
A first course in combinatorial...

A first course in combinatorial optimization

Name: A first course in combinatorial optimization
ISBN: 9780521811514

Jon Lee

0 / 0

0 comments

How much do you like this book?

What’s the quality of the file?

Download the book for quality assessment

What’s the quality of the downloaded files?

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.

Categories:

Mathematics - Optimization. Operations Research

Year:

2004

Publisher:

Cambridge University Press

Language:

english

Pages:

222

ISBN 10:

0521811511