{
"item_title" : "A First Course in Combinatorial Optimization",
"item_author" : [" Jon Lee "],
"item_description" : "Jon Lee focuses on key mathematical ideas leading to useful models and algorithms, rather than on data structures and implementation details, in this introductory graduate-level text for students of operations research, mathematics, and computer science. The viewpoint is polyhedral, and Lee 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.",
"item_img_path" : "https://covers3.booksamillion.com/covers/bam/0/52/181/151/0521811511_b.jpg",
"price_data" : {
"retail_price" : "105.00", "online_price" : "105.00", "our_price" : "105.00", "club_price" : "105.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Overview
Jon Lee focuses on key mathematical ideas leading to useful models and algorithms, rather than on data structures and implementation details, in this introductory graduate-level text for students of operations research, mathematics, and computer science. The viewpoint is polyhedral, and Lee 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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9780521811514
- ISBN-10: 0521811511
- Publisher: Cambridge University Press
- Publish Date: February 2004
- Dimensions: 9 x 6 x 0.8 inches
- Shipping Weight: 0.97 pounds
- Page Count: 228
Related Categories
