More than 4 weeks availability
This book covers the advances in network flow methods ranging across modelling, applications, algorithms, their implementations, and computational complexity. It deals with the problems faced by network structures that can be handled by linear programming techniques or the adaptations. This publication is aimed at professionals involved in mathematical and linear programming in the areas of operations research, industrial engineering, other branches of engineering and business applications.
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.
Number Of Pages:
- ID: 9780136154938
- Saver Delivery: Yes
- 1st Class Delivery: Yes
- Courier Delivery: Yes
- Store Delivery: Yes
Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly
© Copyright 2013 - 2017 WHSmith and its suppliers.
WHSmith High Street Limited Greenbridge Road, Swindon, Wiltshire, United Kingdom, SN3 3LD, VAT GB238 5548 36