Articles liés à Iterative Methods in Combinatorial Optimization
Synopsis
A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos des auteurs
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurCambridge University Press
- Date d'édition2011
- ISBN 10 0521189438
- ISBN 13 9780521189439
- ReliureBroché
- Langueanglais
- Nombre de pages254
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 64,24
EUR 4,70 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisRésultats de recherche pour Iterative Methods in Combinatorial Optimization
Image d'archives
Iterative Methods in Combinatorial Optimization (Cambridge Texts in Applied Mathematics, Series Number 46)
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521189438
ISBN 13 : 9780521189439
Neuf
Couverture souple
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780521189439_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Iterative Methods in Combinatorial Optimization
impression à la demandeVendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 1st edition. 240 pages. 9.00x6.00x0.50 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __0521189438
Quantité disponible : 1 disponible(s)
Image d'archives
Iterative Methods in Combinatorial Optimization
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521189438
ISBN 13 : 9780521189439
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 390. N° de réf. du vendeur C9780521189439
Quantité disponible : Plus de 20 disponibles
Image d'archives
Iterative Methods in Combinatorial Optimization (Cambridge Texts in Applied Mathematics)
Edité par
Cambridge University Press 2011-06-16, 2011
ISBN 10 : 0521189438
ISBN 13 : 9780521189439
Neuf
Paperback
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9780521189439
Quantité disponible : 10 disponible(s)
Image d'archives
Iterative Methods in Combinatorial Optimization
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521189438
ISBN 13 : 9780521189439
Neuf
Couverture souple
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 5529066
Quantité disponible : 3 disponible(s)
Image fournie par le vendeur
Iterative Methods in Combinatorial Optimization
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521189438
ISBN 13 : 9780521189439
Neuf
Kartoniert / Broschiert
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Kartoniert / Broschiert. Etat : 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. N° de réf. du vendeur 594738327
Quantité disponible : Plus de 20 disponibles
Image d'archives
Iterative Methods in Combinatorial Optimization
Edité par
Cambridge University Press CUP, 2011
ISBN 10 : 0521189438
ISBN 13 : 9780521189439
Neuf
Couverture souple
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 262351669
Quantité disponible : 3 disponible(s)
Image d'archives
Iterative Methods in Combinatorial Optimization
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521189438
ISBN 13 : 9780521189439
Neuf
Couverture souple
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 182351679
Quantité disponible : 3 disponible(s)
Image d'archives
Iterative Methods in Combinatorial Optimization
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 1st edition. 240 pages. 9.00x6.00x0.50 inches. In Stock. N° de réf. du vendeur x-0521189438
Quantité disponible : 2 disponible(s)
Image d'archives
Iterative Methods in Combinatorial Optimization (Paperback)
Edité par
Cambridge University Press, Cambridge, 2011
ISBN 10 : 0521189438
ISBN 13 : 9780521189439
Neuf
Paperback
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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. N° de réf. du vendeur 9780521189439
Quantité disponible : 1 disponible(s)