Design approximation algorithms par williamson david (22 résultats)
- Couverture rigide
Vendeur : clickgoodwillbooks, Indianapolis, IN, Etats-Unisclickgoodwillbooks
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Moyen
EUR 43,63
EUR 3,44 expéditionExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Etat : acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may be missing bundled media.
- Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-UnisGreatBookPrices
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 83,55
EUR 2,28 expéditionExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New.
- Couverture rigide
Vendeur : California Books, Miami, FL, Etats-UnisCalifornia Books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 86,19
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New.
- Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-UnisGreatBookPrices
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Comme neuf
EUR 87,03
EUR 2,28 expéditionExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : As New. Unread book in perfect condition.
- Couverture rigide
Vendeur : Ria Christie Collections, Uxbridge, Royaume-UniRia Christie Collections
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 80,10
EUR 13,86 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. In.
- Couverture rigide
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-UniGreatBookPricesUK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 80,09
EUR 17,36 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New.
- Couverture rigide
Vendeur : Rarewaves USA, OSWEGO, IL, Etats-UnisRarewaves USA
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 100,78
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Hardback. Etat : 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 fi…nd 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.
- Couverture rigide
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-UniGreatBookPricesUK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Comme neuf
EUR 91,81
EUR 17,36 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : As New. Unread book in perfect condition.
- Couverture rigide
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-UniRarewaves.com USA
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 114,49
Frais de port gratuitsExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Hardback. Etat : 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 fi…nd 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.
- Couverture rigide
Vendeur : Books Puddle, New York, NY, Etats-UnisBooks Puddle
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 118,67
EUR 3,44 expéditionExpédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. pp. xi + 504 1st Edition.
- Couverture rigide
Vendeur : Revaluation Books, Exeter, , Royaume-UniRevaluation Books
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 120,53
EUR 17,36 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 2 disponible(s)
Hardcover. Etat : Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock.
- Couverture rigide
Vendeur : Kennys Bookstore, Olney, MD, Etats-UnisKennys Bookstore
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 156,75
EUR 9,06 expéditionExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : 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). Dimension: 2…56 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.
- Couverture rigide
Vendeur : Rarewaves.com UK, London, Royaume-UniRarewaves.com UK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 107,78
EUR 75,23 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Hardback. Etat : 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 fi…nd 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.
- Couverture rigide
Vendeur : Mispah books, Redhill, SURRE, Royaume-UniMispah books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Occasion - Comme neuf
EUR 159,74
EUR 28,93 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Couverture rigide
- Édition originale
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandeKennys Bookshop and Art Galleries Ltd.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 181,15
EUR 10,50 expéditionExpédition depuis Irlande vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : 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). Dimension: 2…56 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. . . . . .
- Couverture rigide
- impression à la demande
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-UnisGrand Eagle Retail
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 85,90
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : 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 algo…rithms 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 multiple locations in the US or from the UK, depending on stock availability.
- Couverture rigide
- impression à la demande
Vendeur : Revaluation Books, Exeter, , Royaume-UniRevaluation Books
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 85,48
EUR 17,36 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock. This item is printed on demand.
- Couverture rigide
- impression à la demande
Vendeur : THE SAINT BOOKSTORE, Southport, , Royaume-UniTHE SAINT BOOKSTORE
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 89,42
EUR 25,17 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
- Couverture rigide
- impression à la demande
Vendeur : Majestic Books, Hounslow, , Royaume-UniMajestic Books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 119,26
EUR 7,52 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. Print on Demand pp. xi + 504 Illus.
- Couverture rigide
- impression à la demande
Vendeur : Biblios, frankfurt am main, HESSE, AllemagneBiblios
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 119,69
EUR 9,95 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. PRINT ON DEMAND pp. xi + 504.
- Couverture rigide
- impression à la demande
Vendeur : CitiRetail, Stevenage, Royaume-UniCitiRetail
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 90,59
EUR 42,82 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : 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 algo…rithms 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.
- Couverture rigide
- impression à la demande
Vendeur : moluna, Greven, , Allemagnemoluna
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 87,58
EUR 48,99 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : 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 tech…niques for designing approximation a.
