A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- 1 March 1977
- Vol. 7 (1) , 59-79
- https://doi.org/10.1002/net.3230070105
Abstract
A variant of the revised simplex method is given for solving capacitated network flow problems with additional linear constraints. The mathematical development, computer implementation and computational experience are presented. The algorithm described uses a working basis of size equal to the number of additional linear constraints for pivoting, pricing, and inversion, which for large networks, can result in a substantial reduction of computation over a standard linear programming approach.Keywords
This publication has 9 references indexed in Scilit:
- Solving Constrained Transportation ProblemsOperations Research, 1975
- Efficient computational devices for the capacitated transportation problemNaval Research Logistics Quarterly, 1974
- Finding Equivalent Network Formulations for Constrained Network ProblemsPublished by Defense Technical Information Center (DTIC) ,1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution ProblemsTransportation Science, 1972
- Generalized upper bounding techniquesJournal of Computer and System Sciences, 1967
- An Extension of Generalized Upper Bounding Techniques for Structured Linear ProgramsSIAM Journal on Applied Mathematics, 1967
- Networks and Basic SolutionsOperations Research, 1966
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963