Description: Iterative Methods in Combinatorial Optimization, Paperback by Lau, Lap-chi; Ravi, R.; Singh, Mohit, ISBN 0521189438, ISBN-13 9780521189439, Brand New, Free shipping in the US "With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making th suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"--
Price: 76.3 USD
Location: Jessup, Maryland
End Time: 2024-12-19T12:04:11.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 14 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Iterative Methods in Combinatorial Optimization
Number of Pages: 256 Pages
Publication Name: Iterative Methods in Combinatorial Optimization
Language: English
Publisher: Cambridge University Press
Subject: Programming / Algorithms, Combinatorics, Mathematical Analysis
Item Height: 0.6 in
Publication Year: 2011
Item Weight: 12.7 Oz
Type: Textbook
Author: Lap Chi Lau, R. Ravi, Mohit Singh
Item Length: 9 in
Subject Area: Mathematics, Computers
Series: Cambridge Texts in Applied Mathematics Ser.
Item Width: 6 in
Format: Trade Paperback
