Author:
Correa José R.,Fernandes Cristina G.,Wakabayashi Yoshiko
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference25 articles.
1. Billionnet A.: Approximation algorithms for fractional knapsack problems. Oper. Res. Lett. 30(5), 336–342 (2002)
2. Bitran G.R., Magnanti T.L.: Duality and sensitivity analysis for fractional programs. Oper. Res. 24, 675–699 (1976)
3. Carlson, J., Eppstein, D.: The weighted maximum-mean subtree and other bicriterion subtree problems. In: ACM Computing Research Repository, cs.CG/0503023. (2005)
4. Chen D.Z., Daescu O., Dai Y., Katoh N., Wu X., Xu J.: Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications. J. Comb. Optim. 9, 69–90 (2005)
5. Dantzig G.B., Blattner W., Rao M.R.: Finding a cycle in a graph with minimum cost to time ratio with applications to a ship routing problem. In: Rosensthiel, P. (eds) Theory of Graphs: International Symposium, pp. 77–84. Dunod, Paris (1967)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献