Combinatorial Optimization

Name: Combinatorial Optimization
Author: Christos Papadimitriou

Algorithms and Complexity

Paperback Engels 1998 1e druk 9780486402581

Laatste exemplaren! Op=Op!

Op voorraad | Op werkdagen voor 21:00 besteld, volgende dag in huis

37,19

17,95

In winkelwagen

VOORDEEL - 29% korting

Samenvatting

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.