A unified framework for primal-dual methods in minimum cost network flow problems
- 1 June 1985
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 32 (2) , 125-145
- https://doi.org/10.1007/bf01586087
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Implementation and Testing of a Primal-Dual Algorithm for the Assignment ProblemOperations Research, 1983
- A new algorithm for the assignment problemMathematical Programming, 1981
- MONOTROPIC PROGRAMMING: DESCENT ALGORITHMS AND DUALITYPublished by Elsevier ,1981
- The alternating basis algorithm for assignment problemsMathematical Programming, 1977
- A Class of Decentralized Routing Algorithms Using RelaxationIEEE Transactions on Communications, 1977
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network ProblemsManagement Science, 1974
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955