Categories: 编程算法

Combinatorial Optimization

Clearly written graduate-level text considers 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. "Mathematicians wishing a self-contained introduction need look no further." — "American Mathematical Monthly." 1982 edition..

admin3473

Recent Posts

白露春分

✨《新婚之夜》《有人跳舞》《晚…

5月 ago

商务男装宣传口号230

商务男装宣传口号230   在…

5月 ago

自白录

刘晓庆文集”包括两本书:一本书…

5月 ago

乌镇一日游日记

乌镇一日游日记(通用21篇) …

5月 ago

做家务日记100字

做家务日记100字(通用15篇…

5月 ago

海边旅游日记

海边旅游日记(通用25篇)  …

5月 ago