Upper-level undergraduates and graduate students will benefit from this treatment of discrete optimization algorithms, which covers linear and integer programming and offers a collection of ready-to-use computer programs. 1983 edition.
Upper-level undergraduates and graduate students will benefit from this treatment of discrete optimization algorithms, which covers linear and integer programming and offers a collection of ready-to-use computer programs. 1983 edition.
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.
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.
This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.