Title: Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
Publisher: Dover Publications Inc. 2000-02-01
Publication Date: 2000
Language: English
ISBN 10: 0486402584
ISBN 13: 9780486402581
Binding: Paperback
Condition: New

About this title

Synopsis

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.

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

WRAP Ltd
Unit 4, 119 Loverock Rd, Reading, RG30 1DZ, United Kingdom

Sale & Shipping Terms

Terms of Sale

TBA

Shipping Terms

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.

Shipping rates from United Kingdom to U.S.A.

Shipping rates from United Kingdom to U.S.A.
Order quantity	14 to 21 business days	14 to 21 business days
First item	US$ 20.61	US$ 20.61

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.