Combinatorial optimization : algorithms and complexity
This book brings together in one volume the important ideas of computational complexity developed by computer scientists with the foundations of mathematical programming developed by the operations research community. 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 the basic mathematical objetcs and operations
XVI, 496 p. ; 22 cm
9780486402581, 0486402584
637009339