A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 22,81 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiEUR 9,79 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiDa: 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: Majestic Books, Hounslow, Regno Unito
Condizione: New. pp. 254 44 Illus. Codice articolo 5475650
Quantità: 3 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9781107007512
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781107007512_new
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: 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: moluna, Greven, Germania
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. Codice articolo 468437870
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 254. Codice articolo 262372253
Quantità: 3 disponibili