Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
David P. Williamson is a Professor at Cornell University with a joint appointment in the School of Operations Research and Information Engineering and in the Department of Information Science. Prior to joining Cornell, he was a Research Staff Member at the IBM T. J. Watson Research Center and a Senior Manager at the IBM Almaden Research Center. He has won several awards for his work on approximation algorithms, including the 2000 Fulkerson Prize, sponsored by the American Mathematical Society and the Mathematical Programming Society. He has served on several editorial boards, including ACM Transactions on Algorithms, Mathematics of Operations Research, the SIAM Journal on Computing and the SIAM Journal on Discrete Mathematics.
David Shmoys has faculty appointments in both the School of Operations Research and Information Engineering and the Department of Computer Science, and he is currently Associate Director of the Institute for Computational Sustainability at Cornell University. He is a Fellow of the ACM, was an NSF Presidential Young Investigator, and has served on numerous editorial boards, including Mathematics of Operations Research (for which he is currently an associate editor), Operations Research, the ORSA Journal on Computing, Mathematical Programming and both the SIAM Journal on Computing and the SIAM Journal on Discrete Mathematics; he also served as editor-in-chief for the latter.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 13,88 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiEUR 10,40 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiDa: Prior Books Ltd, Cheltenham, Regno Unito
Hardcover. Condizione: Like New. First Edition. A firm, square and tight hardback with strong joints, just showing a few very bumps and some mild cosmetic wear. Hence a non-text page is stamped 'damaged'. Despite such this book is actually in nearly new condition. Thus the contents are crisp, fresh and clean with no pen-marks. Not from a library so no such stamps or labels. Now offered for sale at a very reasonable price. Codice articolo 209280
Quantità: 2 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780521195270_new
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 11863595-n
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780521195270
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock. This item is printed on demand. Codice articolo __0521195276
Quantità: 1 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Designed as a textbook for graduate courses on algorithms, this book will also serve as a reference for researchers interested in heuristic solutions of discrete optimization problems. It presents central algorithmic techniques for designing approximation a. Codice articolo 516950107
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 11863595-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 1100. Codice articolo C9780521195270
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 11863595
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. xi + 504 1st Edition. Codice articolo 262511591
Quantità: 1 disponibili