Combinatorial Optimization: Algorithms and Complexity

Main
Mathematics - Optimization. Operations Research
Combinatorial Optimization: Algorithms...

Combinatorial Optimization: Algorithms and Complexity

Name: Combinatorial Optimization: Algorithms and Complexity
ISBN: 9780486402581

Christos H. Papadimitriou, Kenneth Steiglitz

5.0 / 3.0

0 comments

دا کتاب تاسو ته څنګه خواښه شوه؟

د بار شوي فایل کیفیت څه دئ؟

تر څو چې د کتاب کیفیت آزمایښو وکړئ، بار ئې کړئ

د بار شوو فایلونو کیفیتی څه دئ؟

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.

درجه (قاطیغوری(:

Mathematics - Optimization. Operations Research

جلد:

کال:

1998

خپرونه:

خپرندویه اداره:

Prentice Hall

ژبه:

english

صفحه:

528