A first course in combinatorial optimization
Jon Lee focuses on key mathematical ideas leading to useful models and algorithms, rather than on data structures and implementation details, in this introductory graduate-level text for students of operations research, mathematics, and computer science. The viewpoint is polyhedral, and Lee also use...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | 図書 |
| 言語: | Undetermined |
| 出版事項: |
Cambridge, UK
Cambridge University Press
2004
|
| 主題: | |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| LEADER | 01130nam a2200205Ia 4500 | ||
|---|---|---|---|
| 001 | CTU_167387 | ||
| 008 | 210402s9999 xx 000 0 und d | ||
| 020 | |c 103 | ||
| 082 | |a 519.64 | ||
| 082 | |b L478 | ||
| 100 | |a Lee, Jon | ||
| 245 | 2 | |a A first course in combinatorial optimization | |
| 245 | 0 | |c Jon Lee | |
| 260 | |a Cambridge, UK | ||
| 260 | |b Cambridge University Press | ||
| 260 | |c 2004 | ||
| 520 | |a Jon Lee focuses on key mathematical ideas leading to useful models and algorithms, rather than on data structures and implementation details, in this introductory graduate-level text for students of operations research, mathematics, and computer science. The viewpoint is polyhedral, and Lee also uses matroids as a unifying idea. Topics include linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Problems and exercises are included throughout as well as references for further study | ||
| 650 | |a Combinatorial optimization,Tối ưu hóa tổ hợp | ||
| 904 | |i Đình Thư, Trúc | ||
| 980 | |a Trung tâm Học liệu Trường Đại học Cần Thơ | ||