£28.99
Free Delivery - Est. 2 week lead time *
Backed by the Rackhams Guarantee
Combinatorial Optimisation by Christos H. Papadimitriou and Kenneth Steiglitz is a clearly written, graduate-level text on algorithms and complexity. This paperback edition from Dover Publications Inc runs to 528 pages.
This self-contained volume examines combinatorial optimisation through the lens of modern algorithm design and computational complexity. Coverage includes the Soviet ellipsoid algorithm for linear programming, alongside efficient methods for network flow, matching, spanning trees and matroids.
It also introduces the theory of NP-complete problems, before moving on to approximation algorithms and local search heuristics for NP-complete problems. Aimed at readers working in science, mathematics and engineering, it is presented as a graduate-level text.
Rackhams Reference : 11L2FJ2UEB
Author
Christos H. Papadimitriou, Kenneth Steiglitz
Type
bc paperback
This product is supplied by one of our approved partners.
Rackhams brings together a curated group of trusted partners so you can shop a wider range of premium products in one place — all backed and guaranteed by Rackhams.
We remain your single point of contact for every order, managing your experience from checkout through to delivery and after-sales support.
Learn more about the Rackhams Guarantee.