Get Free Shipping on orders over $0
Combinatorial Optimization : Algorithms and Complexity - CHRISTOS H. PAPADIMITRIOU

Combinatorial Optimization

Algorithms and Complexity

By: CHRISTOS H. PAPADIMITRIOU

Paperback | 1 February 2000

At a Glance

Paperback


RRP $85.00

$54.75

36%OFF

or 4 interest-free payments of $13.69 with

 or 

Ships in 10 to 15 business days

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.

More in Mathematics

How to Win At Chess : The Ultimate Guide for Beginners and Beyond - Levy Rozman
Science and Math : From Zero to Infinity in over 3000 facts - Flynn, Mike
The Maths Book : Big Ideas Simply Explained - DK

RRP $45.00

$35.75

21%
OFF
Sir Cumference and the Roundabout Battle : Sir Cumference - CINDY NEUSCHWANDER
Antifragile : Things That Gain from Disorder - Nassim Nicholas Taleb

RRP $27.99

$23.75

15%
OFF
A Visual Approach to Introductory Functional Analysis - Paul Dayao
Statistics and Data Handling for Biologists : A Student's Guide - Neil Millar
Six Maths Essentials : How to Model the World - Terence Tao

RRP $49.99

$38.75

22%
OFF
Introductory Statistics - Sheldon M. Ross

$300.99

Arches : A Dance of Centres - Jon Allen
Algebra Workbook Grades 6-8 : Algebra - Kumon

RRP $24.99

$18.99

24%
OFF