Da
Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 25 marzo 2015
In. Codice articolo ria9781107007512_new
A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization.
Informazioni sugli autori:
Lap-Chi Lau is an Assistant Professor in the Department of Computer Science and Engineering at The Chinese University of Hong Kong. Lap-Chi's main research interests are in combinatorial optimization and graph algorithms. His paper on Steiner tree packing was given the Machtey award in the IEEE Foundations of Computer Science Conference. His Ph.D. thesis was awarded the Doctoral Prize from the Canadian Mathematical Society and a Doctoral Prize from the Natural Sciences and Engineering Research Council of Canada.
R. Ravi is Carnegie Bosch Professor of Operations Research and Computer Science at Carnegie Mellon University. Ravi's main research interests are in combinatorial optimization (particularly in approximation algorithms), computational molecular biology and electronic commerce. He is currently on the editorial boards of Management Science and the ACM Transactions on Algorithms.
Mohit Singh is an Assistant Professor in the School of Computer Science, McGill University. He completed his Ph.D. in 2008 at the Tepper School of Business, Carnegie Mellon University, where his advisor was Professor R. Ravi. His thesis was awarded the Tucker prize by the Mathematical Programming Society. His research interests include approximation algorithms, combinatorial optimization and studying models that deal with uncertainty in data.
Titolo: Iterative Methods in Combinatorial ...
Casa editrice: Cambridge University Press
Data di pubblicazione: 2011
Legatura: Rilegato
Condizione: New
Da: Labyrinth Books, Princeton, NJ, U.S.A.
Condizione: Very Good. Codice articolo 139533
Quantità: 1 disponibili
Da: WYEMART LIMITED, HEREFORD, Regno Unito
Hardcover. Condizione: New. Codice articolo mon0000273393
Quantità: 2 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 12442402-n
Quantità: Più di 20 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Mar2317530263092
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 1st edition. 240 pages. 9.00x6.00x0.75 inches. In Stock. This item is printed on demand. Codice articolo __1107007518
Quantità: 1 disponibili
Da: AussieBookSeller, Truganina, VIC, Australia
Hardcover. Condizione: new. Hardcover. 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. 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Codice articolo 9781107007512
Quantità: 1 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9781107007512
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 12442402-n
Quantità: Più di 20 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 510. Codice articolo C9781107007512
Quantità: Più di 20 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Hardcover. Condizione: new. Hardcover. 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. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9781107007512
Quantità: 1 disponibili