Vendeur
HPB-Red, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Vendeur AbeBooks depuis 11 mars 2019
Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! N° de réf. du vendeur S_432341800
Ce texte de niveau universitaire, rédigé avec clarté, examine l'algorithme soviétique de l'ellipsoïde pour la programmation linéaire, les algorithmes efficaces pour le flux de réseau, la correspondance, les arbres couvrants et les matroïdes, la théorie des problèmes NP-complets, les algorithmes d'approximation, les heuristiques de recherche locale pour les problèmes NP-complets, et bien plus encore.Les mathématiciens qui souhaitent une introduction autonome n'ont pas besoin de chercher plus loin.― American Mathematical Monthly. Édition 1982.
Présentation de l'éditeur: This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." American Mathematical Monthly. 1982 ed.
Titre : Combinatorial Optimization: Algorithms and ...
Éditeur : Dover Publications
Date d'édition : 1998
Reliure : Paperback
Etat : Good
Vendeur : WorldofBooks, Goring-By-Sea, WS, Royaume-Uni
Paperback. Etat : Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. N° de réf. du vendeur GOR002932595
Quantité disponible : 5 disponible(s)
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Good. Used book that is in clean, average condition without any missing pages. N° de réf. du vendeur 4338829-6
Quantité disponible : 1 disponible(s)
Vendeur : Red's Corner LLC, Tucker, GA, Etats-Unis
Etat : LikeNew. All orders ship by next business day! This is a used paperback book with wear due to handling. Pages have no markings. For USED books, we cannot guarantee supplemental materials such as CDs, DVDs, access codes and other materials. We are a small company and very thankful for your business! N° de réf. du vendeur 4CNO3H0027QS
Quantité disponible : 1 disponible(s)
Vendeur : INDOO, Avenel, NJ, Etats-Unis
Etat : New. Brand New. N° de réf. du vendeur 9780486402581
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 440491-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Speedyhen, London, Royaume-Uni
Etat : NEW. N° de réf. du vendeur NW9780486402581
Quantité disponible : 3 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur S1-9780486402581
Quantité disponible : 15 disponible(s)
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Paperback / softback. Etat : New. New copy - Usually dispatched within 4 working days. 650. N° de réf. du vendeur B9780486402581
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 440491
Quantité disponible : Plus de 20 disponibles
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Paperback. Etat : new. Paperback. This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." - American Mathematical Monthly. This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9780486402581
Quantité disponible : 1 disponible(s)