Combinatorial Optimization: Algorithms and Complexity
  Zoom

Combinatorial Optimization: Algorithms and Complexity

ISBN 13:  9780486402581

FREE Shipping on 3 books or more! - for all UK orders - find out more

Availability:  

Import stock, currently extended lead times to 2 - 3 weeks.  

Import stock, currently extended lead times to 2 - 3 weeks.

Author:  Christos H. Papadimitriou
Format:  Paperback
No. of Pages:  528
Brand:  Dover Publications

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. 1982 ed.

Illustrations: -
Author: Papadimitriou
Size: -
Format: Book
Copyright: -
ISBN 13: 9780486402581

Be the first to Write a Review for this item!

UK Delivery

Order 3 or more books to enjoy FREE UK delivery!

Method Cost for Single Book Additional Book
UK Standard £2.70 £0.80   *  Order 3 + books for FREE delivery
UK First Class £3.90 £2.00

Overseas

Method Cost for Delivery Plus Cost per Book
Europe (Standard Air via Royal Mail) £5.00 £1.50
Rest of World (Air Mail) £5.00 £5.00

In Stock items are sent same day (Monday to Friday before 3 pm) or within one working day.

Find out more in our full delivery and returns information