Network programming
Author(s)
Bibliographic Information
Network programming
Prentice Hall, c1992
Available at / 24 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
Table of Contents
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.
by "Nielsen BookData"
