Rich in publications, the well-established field of discrete optimization nevertheless features relatively few books with ready-to-use computer programs. This book, geared toward upper-level undergraduates and graduate students, addresses that need. In addition, it offers a look at the programs' deri... read more
Customers who bought this book also bought:
Our Editors also recommend:
Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz This 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; local search heuristics for NP-complete problems, more. 1982 edition.
Mathematics for Algorithm and Systems Analysis by Edward A. Bender, S. Gill Williamson Discrete mathematics is fundamental to computer science, and this text covers its ideas and mathematical language. Features counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
Linear Programming: Methods and Applications: Fifth Edition by Dr. Saul I. Gass Comprehensive, well-organized volume, suitable for undergraduates, covers theoretical, computational, and applied areas in linear programming. Expanded, updated edition; useful both as a text and as a reference book. 1995 edition.
An Introduction to Identification by J. P. Norton Suitable for advanced undergraduates and graduate students, this text covers the theoretical basis for mathematical modeling as well as a variety of identification algorithms and their applications. 1986 edition.
Product Description:
Rich in publications, the well-established field of discrete optimization nevertheless features relatively few books with ready-to-use computer programs. This book, geared toward upper-level undergraduates and graduate students, addresses that need. In addition, it offers a look at the programs' derivation and performance characteristics. Subjects include linear and integer programming, packing and covering, optimization on networks, and coloring and scheduling. A familiarity with design, analysis, and use of computer algorithms is assumed, along with knowledge of programming in Pascal. The book can be used as a supporting text in discrete optimization courses or as a software handbook, with twenty-six programs that execute the most common algorithms in each topic area. Each chapter is self-contained, allowing readers to browse at will.
Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1983 edition.
This book was printed in the United States of America.
Dover books are made to last a lifetime. Our US book-manufacturing partners produce the highest quality books in the world and they create jobs for our fellow citizens. Manufacturing in the United States also ensures that our books are printed in an environmentally friendly fashion, on paper sourced from responsibly managed forests.