Network Programming
Published on 1. October 1992
Book
Paperback/Softback
640 pages
978-0-13-615493-8 (ISBN)
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.
More details
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 243 mm
Width: 184 mm
Thickness: 31 mm
Weight
1120 gr
ISBN-13
978-0-13-615493-8 (9780136154938)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
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.
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.