Combinatorial Optimization : Algorithms and complexity
This book includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search...
সংরক্ষণ করুন:
| প্রধান লেখক: | |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | গ্রন্থ |
| ভাষা: | Vietnamese |
| প্রকাশিত: |
New York
Dover Publications, Inc.
1998
|
| বিষয়গুলি: | |
| ট্যাগগুলো: |
ট্যাগ যুক্ত করুন
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Nam Cần Thơ |
|---|
| সংক্ষিপ্ত: | This book includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. |
|---|---|
| দৈহিক বর্ননা: | xvi, 496 p. ill. 22cm |
| গ্রন্থ-পঞ্জী: | Includes bibliographical references and index |
| আইসবিএন: | 9780486402581 |