Discrete optimization / Computer science and scientific computing
Material type:
TextSeries: Computer Science and Scientific ComputingPublication details: UK Academic Press 1988Description: 472p., 241 x 165mm, Illustrations, hardbackISBN: - 0125450753
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
| Standard Loan | Thurles Library Main Collection | 511.6 PAR (Browse shelf(Opens below)) | Available | R06303KRCT |
Enhanced descriptions from Syndetics:
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.
ICT