Articoli correlati a Iterative Methods in Combinatorial Optimization
Sinossi
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.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreCambridge University Press
- Data di pubblicazione2011
- ISBN 10 0521189438
- ISBN 13 9780521189439
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine254
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 58,49
EUR 11,87 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiRisultati della ricerca per Iterative Methods in Combinatorial Optimization
Foto dell'editore
Iterative Methods in Combinatorial Optimization
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 1st edition. 240 pages. 9.00x6.00x0.50 inches. In Stock. This item is printed on demand. Codice articolo __0521189438
Quantità: 1 disponibili
Foto dell'editore
Iterative Methods in Combinatorial Optimization
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 5529066
Quantità: 3 disponibili
Foto dell'editore
Iterative Methods in Combinatorial Optimization
Editore:
Cambridge University Press, 2011
ISBN 10: 0521189438
ISBN 13: 9780521189439
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 390. Codice articolo C9780521189439
Quantità: Più di 20 disponibili
Foto dell'editore
Iterative Methods in Combinatorial Optimization (Cambridge Texts in Applied Mathematics, Series Number 46)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780521189439_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Iterative Methods in Combinatorial Optimization
Editore:
Cambridge University Press, 2011
ISBN 10: 0521189438
ISBN 13: 9780521189439
Nuovo
Kartoniert / Broschiert
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Kartoniert / Broschiert. 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 594738327
Quantità: Più di 20 disponibili
Foto dell'editore
Iterative Methods in Combinatorial Optimization
Editore:
Cambridge University Press CUP, 2011
ISBN 10: 0521189438
ISBN 13: 9780521189439
Nuovo
Brossura
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo 262351669
Quantità: 3 disponibili
Foto dell'editore
Iterative Methods in Combinatorial Optimization
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 182351679
Quantità: 3 disponibili
Foto dell'editore
Iterative Methods in Combinatorial Optimization (Cambridge Texts in Applied Mathematics)
Editore:
Cambridge University Press 2011-06-16, 2011
ISBN 10: 0521189438
ISBN 13: 9780521189439
Nuovo
Paperback
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: New. Codice articolo 6666-IUK-9780521189439
Quantità: 10 disponibili
Foto dell'editore
Iterative Methods in Combinatorial Optimization
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 1st edition. 240 pages. 9.00x6.00x0.50 inches. In Stock. Codice articolo x-0521189438
Quantità: 2 disponibili
Foto dell'editore
Iterative Methods in Combinatorial Optimization (Paperback)
Editore:
Cambridge University Press, Cambridge, 2011
ISBN 10: 0521189438
ISBN 13: 9780521189439
Nuovo
Paperback
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Paperback. 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. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9780521189439
Quantità: 1 disponibili