Combinatorial Optimization

　　The text offers novel treatments of several topics\: the theory of the simplex algorithm, the finiteness issue, and the lexicographic method introduced later for integer programming. And throughout the linear programming sections the authors have given geometric interpretations of tile basic mathematical objects and operations. "The book should make an outstanding text for advanced courses on the design and analysis of algorithms for mathematically sophisticated students in computer science, operations research, electrical engineering, or mathematics. Practitioners in those fields will als0 find it useful as a state-of-the art reference."
　　 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."

algorithm(2)  数学(2)  combinatorial(1)  CS(1)  math(1)  optimazation(1)  programming(1)  theory(1)  

这本书不错，想购买	来自dinggsh		2007-02-01