This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

BennettBooksLtd
NV, U.S.A.

Gesch�ftsbedingungen:

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.

Versandinformationen:

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.

Zahlungsarten
akzeptiert von diesem Verk�ufer

Zu Kaufgesuchen hinzuf�gen

Verwandte Artikel zu Complexity and Approximation: Combinatorial Optimization...

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Ausiello, G.; Crescenzi, P.; Kann, V.; Marchetti-sp; Gambosi, Giorgio; Spaccamela, Alberto M.

Neu - Hardcover

Unternehmensdaten des Verk�ufers