Integer Programming Hamdy Taha 1975 1st Ed Operations Research Academic Press

I’m offering the original 1975 first edition of Integer Programming: Theory, Applications, and Computations by Hamdy A. Taha, published by Academic Press as part of its Operations Research and Industrial Engineering series.

This is the hardcover ISBN 0-12-682150-X edition, not the later reprint. The book runs 380 pages and covers integer optimization, linear programming, zero-one implicit enumeration, branch-and-bound methods, cutting methods, asymptotic integer algorithms, specialized integer models and computational considerations.

Taha discusses applications including the knapsack problem, plant-location problems, the traveling-salesman problem and set-covering problems. It remains a useful period reference for operations research, industrial engineering, mathematical optimization and the development of integer-programming methods.

The burgundy cloth boards have light shelf and handling wear, with the gilt cover lettering still clear. The interior pages are clean. A previous-owner signature is written on the front endpaper. No dust jacket is present.

Author: Hamdy A. Taha

Book Title: Integer Programming: Theory, Applications, and Computations

Language: English

ISBN: 012682150X / 9780126821505

Topic: Integer Programming, Operations Research, Mathematical Optimization

Publisher: Academic Press

Format: Hardcover

Narrative Type: Nonfiction

Special Features: First Edition, Bibliography, Index

Publication Year: 1975

Signed: No

Intended Audience: College, University, Engineers, Researchers

Vintage: Yes

Ex Libris: No

Inscribed: No

Personalized: No

Era: 1970s

Illustrator: Not Specified

Literary Movement: Not Applicable

Genre: Mathematics, Engineering, Operations Research

Subject: Integer Programming, Linear Programming, Branch and Bound, Optimization

Hamdy Taha, Integer Programming, Theory Applications Computations, Academic Press, 1975 first edition, operations research, industrial engineering, mathematical optimization, linear programming, branch and bound, cutting plane methods, integer optimization, traveling salesman problem, knapsack problem, vintage mathematics book