ISBN-13: 9780486453538 / Angielski / Miękka / 2006 / 541 str.
Upper-level undergraduates and graduate students will benefit from this treatment of discrete optimization algorithms, which covers linear and integer programming. It offers ready-to-use computer programs, together with their derivation and performance characteristics. Subjects include packing and covering, optimization on networks, and coloring and scheduling. 1983 edition.