Author:
Correa José R.,Fernandes Cristina G.,Wakabayashi Yoshiko
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Billionnet, A.: Approximation algorithms for fractional knapsack problems. Operations Research Letters 30(5), 336–342 (2002)
2. Bitran, G.R., Magnanti, T.L.: Duality and sensitivity analysis for fractional programs. Operations Research 24, 675–699 (1976)
3. Carlson, J., Eppstein, D.: The weighted maximum-mean subtree and other bicriterion subtree problems. In: ACM Computing Research Repository(2005) cs.CG/0503023
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. Journal of Combinatorial Optimization 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. (ed.) Theory of Graphs: Int. Symposium, Dunod, Paris, pp. 77–84 (1967)