ENGLISH

Discrete Optimization

By R. Gary Parker and Ronald L. Rardin (Auth.)

Book information

Publisher
Academic Press, Elsevier Inc
Year
1988
ISBN
978-0-12-545075-1, 0125450753
Language
english
Format
PDF
Filesize
21 MB (21529529 bytes)
Series
Computer Science and Scientific Computing
Pages
472\475
Time added
2014-08-05 10:00:00
Математика;Методы оптимизации

Description

This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms. Several appendixes are included which review the fundamental ideas of linear programming, graph theory, and combinatorics--prerequisites for readers of the text. Numerous exercises are included at the end of each chapter

Similar books