Network Programming
- Binding: Hardcover
- Edition: 1
- Publisher: Prentice Hall
- Publish date: 06/01/1992
Description:
1. Network Definitions and Formulations. 2. Single Commodity Maximum Value Flow Problems in Pure Networks. 3. Primal-Dual and Dual Algorithms for the Assignment and Transportation Problems. 4. Shortest Chain Algorithms. 5. Algorithms for Minimum Cost Flow Problems in Pure Networks. 6. Single Commodity Flows with Additional Linear Constraints. 7. Critical Path Methods in Project Networks. 8. Generalized Network Flows. 9. The Minimum Cost Spanning Tree Problem. 10. Blossom Algorithms for 1-Matching/Edge Covering Problems in Indirected Networks. Index.
Expand description
Product notice
Returnable at the third party seller's discretion and may come without consumable supplements like access codes, CD's, or workbooks.
| Seller | Condition | Comments | Price |
|
Affordable Products
|
Good
|
$244.98
|
Please Wait