Iterative methods in combinatorial optimization [electronic resource] / Lap Chi Lau, R. Ravi, Mohit Singh.

"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...

Full description

Bibliographic Details
Uniform Title:Cambridge texts in applied mathematics.
Main Author: Lau, Lap Chi
Other Authors: Ravi, R. (Ramamoorthi), 1969-
Singh, Mohit
Language:English
Published: Cambridge ; New York : Cambridge University Press, 2011.
Series:Cambridge texts in applied mathematics.
Subjects:
Online Access:
Format: Electronic eBook

MARC

LEADER 00000nam a22000003a 4500
001 ebs1143789e
003 EBZ
006 m o d ||||||
007 cr|unu||||||||
008 110202s2011 enka ob 001 0 eng
020 |z 9780521189439 
020 |z 9781107007512 
020 |a 9780511977152 (online) 
020 |a 9781107221772 (online) 
020 |a 9781139076524 (online) 
020 |a 9781139078801 (online) 
020 |a 9781139081078 (online) 
020 |a 9781139083348 (online) 
020 |a 9781283111164 (online) 
035 |a (EBZ)ebs1143789e 
040 |a DLC   |d EBZ 
042 |a pcc 
050 0 0 |a QA297.8  |b .L38 2011 
100 1 |a Lau, Lap Chi. 
245 1 0 |a Iterative methods in combinatorial optimization  |h [electronic resource] /  |c Lap Chi Lau, R. Ravi, Mohit Singh. 
260 |a Cambridge ;  |a New York :  |b Cambridge University Press,  |c 2011. 
490 1 |a Cambridge texts in applied mathematics 
504 |a Includes bibliographical references and index. 
520 |a "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 the book 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"--  |c Provided by publisher. 
520 |a "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 the book 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"--  |c Provided by publisher. 
650 0 |a Iterative methods (Mathematics) 
650 0 |a Combinatorial optimization. 
700 1 |a Ravi, R.  |q (Ramamoorthi),  |d 1969- 
700 1 |a Singh, Mohit. 
773 0 |t ProQuest Ebook Central - Academic Complete   |d ProQuest Info & Learning Co 
773 0 |t EBSCO eBooks   |d EBSCO 
773 0 |t eBook Academic Collection (EBSCOhost) – North America   |d EBSCO 
776 1 |t Iterative methods in combinatorial optimization /  |w (OCoLC)ocn694393831  |w (DLC)2011003653 
830 0 |a Cambridge texts in applied mathematics. 
856 4 0 |y Access Content Online(from ProQuest Ebook Central - Academic Complete)  |u https://ezproxy.msu.edu/login?url=https://ebookcentral.proquest.com/lib/michstate-ebooks/detail.action?docID=691988  |z ProQuest Ebook Central - Academic Complete: 2011 
856 4 0 |y Access Content Online(from EBSCO eBooks)  |u https://ezproxy.msu.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=366290  |z EBSCO eBooks: 2011 
856 4 0 |y Access Content Online(from eBook Academic Collection (EBSCOhost) – North America)  |u https://ezproxy.msu.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=e000xna&AN=366290  |z eBook Academic Collection (EBSCOhost) – North America: 2011