Clearly written 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; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." ― American Mathematical Monthly. 1982 edition.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

BennettBooksLtd
NV, U.S.A.

Condiciones de venta:

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Condiciones de env�o:

Orders ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

M�todos de pago
aceptados por la librer�a

A�adir una petici�n

Art�culos relacionados a Combinatorial Optimization: Algorithms and Complexity...

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)

Papadimitriou, Christos H.; Steiglitz, Kenneth

Nuevos - Encuadernaci�n de tapa blanda

Informaci�n empresarial del vendedor