First Course in Combinatorial Optimization

Name: First Course in Combinatorial Optimization
Price: 48.42 USD
Availability: InStock
ISBN: 9780521010122

ISBN-10: 0521010128

ISBN-13: 9780521010122

Edition: 2004

Authors: Jon Lee, M. J. Ablowitz, S. H. Davis, E. J. Hinch, A. Iserles

List price: $54.99

This item qualifies for FREE shipping.

30 day, 100% satisfaction guarantee!

Buy new: $48.42

Marketplace

2 new & used from $51.87

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

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,…

Book details

List price: $54.99
Copyright year: 2004
Publisher: Cambridge University Press
Publication date: 2/9/2004
Binding: Paperback
Pages: 228
Size: 5.98" wide x 9.02" long x 0.67" tall
Weight: 0.682
Language: English



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