{
"item_title" : "Geometric Algorithms and Combinatorial Optimization",
"item_author" : [" Martin Grötschel", "Laszlo Lovasz", "Alexander Schrijver "],
"item_description" : "This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. The book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. To quote from a review: This book ... is doubtless one of the outstanding books in discrete mathematics at all. (Journal of Information Proceedings and Cybernetics).",
"item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/64/278/242/3642782426_b.jpg",
"price_data" : {
"retail_price" : "159.99", "online_price" : "159.99", "our_price" : "159.99", "club_price" : "159.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Geometric Algorithms and Combinatorial Optimization
Overview
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. The book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. To quote from a review: "This book ... is doubtless one of the outstanding books in discrete mathematics at all." (Journal of Information Proceedings and Cybernetics).
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783642782428
- ISBN-10: 3642782426
- Publisher: Springer
- Publish Date: December 2011
- Dimensions: 9.5 x 6.7 x 0.8 inches
- Shipping Weight: 1.4 pounds
- Page Count: 362
Related Categories
