LEADER 03608nam  22007212  450 
001 9910821985403321
005 20151005020622.0
010   $a1-107-22177-3
010   $a1-283-11116-0
010   $a9786613111166
010   $a1-139-07652-3
010   $a0-511-97715-8
010   $a1-139-08334-1
010   $a1-139-07880-1
010   $a1-139-08107-1
010   $a1-139-07080-0
035   $a(CKB)2670000000093843
035   $a(EBL)691988
035   $a(OCoLC)726734811
035   $a(SSID)ssj0000523591
035   $a(PQKBManifestationID)11333399
035   $a(PQKBTitleCode)TC0000523591
035   $a(PQKBWorkID)10542705
035   $a(PQKB)11558967
035   $a(UkCbUP)CR9780511977152
035   $a(Au-PeEL)EBL691988
035   $a(CaPaEBR)ebr10470664
035   $a(CaONFJC)MIL311116
035   $a(MiAaPQ)EBC691988
035   $a(PPN)189906545
035   $a(EXLCZ)992670000000093843
100   $a20101013d2011||||  uy|            0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aIterative methods in combinatorial optimization /$fLap Chi Lau, R. Ravi, Mohit Singh$b[electronic resource]
210  1$aCambridge :$cCambridge University Press,$d2011.
215   $a1 online resource (xi, 242 pages) $cdigital, PDF file(s)
225 1 $aCambridge texts in applied mathematics ;$v46
300   $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
311   $a0-521-18943-8 
311   $a1-107-00751-8 
320   $aIncludes bibliographical references and index.
327   $aMachine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary.
330   $aWith 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.
410  0$aCambridge texts in applied mathematics ;$v46.
606   $aIterative methods (Mathematics)
606   $aCombinatorial optimization
615  0$aIterative methods (Mathematics)
615  0$aCombinatorial optimization.
676   $a518/.26
686   $aCOM000000$2bisacsh
700   $aLau$b Lap Chi$01654147
702   $aRavi$b R$g(Ramamoorthi),$f1969-
702   $aSingh$b Mohit
801  0$bUkCbUP
801  1$bUkCbUP
906   $aBOOK
912   $a9910821985403321
996   $aIterative methods in combinatorial optimization$94005802
997   $aUNINA