Design approximation algorithms di williamson david (25 risultati)
- Rilegato
Da: Bay State Book Company, North Smithfield, RI, U.S.A.Bay State Book Company
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 38,04
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Condizione: very_good.
Editore: Cambridge University Press
- Rilegato
Da: Academic Book Solutions, Medford, NY, U.S.A.Academic Book Solutions
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 36,09
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Aggiungi al carrellohardcover. Condizione: VeryGood. A copy that may have been read, very minimal wear and tear. May have a remainder mark.
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 87,15
EUR 2,27 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Rilegato
Da: Chiron Media, Wallingford, Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 73,01
EUR 18,03 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: New.
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 89,88
EUR 2,27 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Rilegato
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 92,23
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 84,24
EUR 13,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Rilegato
Da: Rarewaves USA, HEBRON, KY, U.S.A.Rarewaves USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 100,59
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms…to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
- Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 84,22
EUR 17,46 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 92,34
EUR 17,46 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 115,47
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardback. Condizione: New. Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms…to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 97,91
EUR 17,46 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock.
- Rilegato
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 95,87
EUR 25,31 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardback. Condizione: New. New copy - Usually dispatched within 3 working days.
- Rilegato
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 125,88
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. xi + 504 1st Edition.
- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 120,52
EUR 17,46 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock.
- Rilegato
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 87,58
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Gebunden. Condizione: New. 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.
- Rilegato
Da: Rarewaves USA United, HEBRON, KY, U.S.A.Rarewaves USA United
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 102,78
EUR 43,05 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms…to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
- Rilegato
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 156,36
EUR 9,04 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New. 2011. 1st Edition. Hardcover. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Num Pages: 518 pages, 86 b/w illus. 121 exercises. BIC Classification: PBU; UMB; UMZ. Category: (U) Tertiary Education (US: College). Dimensi…on: 256 x 186 x 32. Weight in Grams: 1154. 516 pages, 86 b/w illus. 121 exercises. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Cateogry: (U) Tertiary Education (US: College). BIC Classification: PBU; UMB; UMZ. Dimension: 256 x 186 x 32. Weight: 1086. . . . . . Books ship from the US and Ireland.
- Rilegato
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 112,28
EUR 75,65 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardback. Condizione: New. Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms…to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
- Rilegato
- Prima edizione
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 181,15
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 1 disponibili
Condizione: New. 2011. 1st Edition. Hardcover. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Num Pages: 518 pages, 86 b/w illus. 121 exercises. BIC Classification: PBU; UMB; UMZ. Category: (U) Tertiary Education (US: College). Dimensi…on: 256 x 186 x 32. Weight in Grams: 1154. 516 pages, 86 b/w illus. 121 exercises. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Cateogry: (U) Tertiary Education (US: College). BIC Classification: PBU; UMB; UMZ. Dimension: 256 x 186 x 32. Weight: 1086. . . . . .
- Rilegato
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Come nuovo
EUR 166,62
EUR 29,10 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Rilegato
- Print on Demand
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 89,92
EUR 25,31 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
- Rilegato
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 125,07
EUR 7,56 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. xi + 504 Illus.
- Rilegato
- Print on Demand
Da: CitiRetail, Stevenage, Regno UnitoCitiRetail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 91,09
EUR 43,06 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: new. Hardcover. Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient… algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems. 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 algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
- Rilegato
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 129,47
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. xi + 504.
