Author:
Aneja Y.P,Chandrasekaran R,Nair K.P.K
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993, Networks 38 (2001) 194–198.
2. Maximizing residual flow under an arc destruction;Aneja;Networks,2001
3. Bicriteria transportation problem;Aneja;Management Sci.,1979
4. Maximal expected flow in a network subject to arc failures;Aneja;Networks,1980
5. Minimal ratio spanning trees;Chandrasekaran;Networks,1977
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximum Flows in Parametric Graph Templates;Lecture Notes in Computer Science;2023
2. Parallel cut tree algorithms;Journal of Parallel and Distributed Computing;2017-11
3. Flows over edge-disjoint mixed multipaths and applications;Discrete Applied Mathematics;2007-09