A note on the primal-dual and out-of-kilter algorithms for network optimization problems
- 1 March 1977
- Vol. 7 (1), 81-88
- https://doi.org/10.1002/net.3230070106
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Using duality to solve discrete optimization problems: Theory and computational experiencePublished by Springer Nature ,1975
- Validation of subgradient optimizationMathematical Programming, 1974
- An improved version of the out-of-kilter method and a comparative study of computer codesMathematical Programming, 1974
- Constructive Duality in Integer ProgrammingSIAM Journal on Applied Mathematics, 1974
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- New Methods in Mathematical Programming—Optimal Flow Through Networks with GainsOperations Research, 1962
- An Out-of-Kilter Method for Minimal-Cost Flow ProblemsJournal of the Society for Industrial and Applied Mathematics, 1961