Reference68 articles.
1. R.K. Ahuja, Minimum cost-reliability ratio path problem. Comput. Oper. Res. 15, 83–89 (1988)
2. R.E. Bellman, On a routing problem. Q. Appl. Math. 16, 87–90 (1958)
3. A. Billionnet, Approximation algorithms for fractional knapsack problems. Oper. Res. Lett. 30(5), 336–342 (2002)
4. M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection. J. Comp. Syst. Sci. 7(4), 448–461 (1973)
5. J. Carlson, D. Eppstein, The weighted maximum-mean subtree and other bicriterion subtree problems. CoRR. (2005). abs/cs/0503023
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献