Discrete Optimization

Main
Mathematics - Optimization. Operations Research
Discrete Optimization

Discrete Optimization

Name: Discrete Optimization
ISBN: 9780125450751

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

5.0 / 4.0

0 comments

この本はいかがでしたか？

ファイルの質はいかがですか？

質を評価するには、本をダウンロードしてください。

ダウンロードしたファイルの質はいかがでしたか？

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

カテゴリー:

Mathematics - Optimization. Operations Research

年:

1988

出版社:

Elsevier Inc, Academic Press

言語:

english

ページ:

472

ISBN 10:

0125450753