Combinatorial Optimization

Combinatorial Optimization Algorithms and Complexity - Dover Books on Computer Science

New edition

Paperback (01 Feb 2000)

Save $4.79

  • RRP $32.28
  • $27.49
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within two working days

Publisher's Synopsis

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.

Book information

ISBN: 9780486402581
Publisher: Dover Publications Inc.
Imprint: Dover Publications
Pub date:
Edition: New edition
DEWEY: 519.3
DEWEY edition: 21
Language: English
Number of pages: 496
Weight: 644g
Height: 214mm
Width: 136mm
Spine width: 26mm