Dual Based Procedures for Un-Capacitated Minimum Cost Flow Problem
Open Access
- 1 January 2016
- journal article
- Published by Scientific Research Publishing, Inc. in American Journal of Operations Research
- Vol. 06 (06), 468-479
- https://doi.org/10.4236/ajor.2016.66043
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- An efficient heuristic to obtain a better initial feasible solution to the transportation problemApplied Soft Computing, 2015
- A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEMAsia-Pacific Journal of Operational Research, 2009
- A new dual based procedure for the transportation problemEuropean Journal of Operational Research, 2000
- Dual Algorithms for Pure Network ProblemsOperations Research, 1989
- An Efficient Procedure for Implementing a Dual Simplex Network Flow AlgorithmA I I E Transactions, 1977
- A Primal Algorithm to Solve Network Flow Problems with Convex CostsManagement Science, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972