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

The Saint Bookstore has a range of over 1 million titles available.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

SB ONLINE LTD
50 Devonshire Road, Southport, PR9 7BZ, United Kingdom

Condiciones de venta:

Please order through the Abebooks checkout. We only take orders through Abebooks - We don't take direct orders by email or phone.

Refunds or Returns: A full refund of the purchase price will be given if returned within 30 days in undamaged condition.

As a seller on abebooks we adhere to the terms explained at http://www.abebooks.co.uk/docs/HelpCentral/buyerIndex.shtml - if you require further assistance please email us at orders@thesaintbookstore.co.uk

Condiciones de env�o:

Most orders usually ship within 1-3 business days, but some can take up to 7 days.

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

Christos H. Papadimitriou

Nuevos - Encuadernaci�n de tapa blanda

Informaci�n empresarial del vendedor