Approximation algorithms for fractional knapsack problems

Operations Research Letters

Volumn 30, Issue 5, 2002, Pages 336-342

  Billionnet, Alain ^a  

^a CEDRIC   (France)

Author keywords

Approximation algorithm; Approximation scheme; Combinatorial fractional programming; Fractional knapsack problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS;

COMBINATORIAL MATHEMATICS;

EID: 0036795419     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00157-8     Document Type: Article

References (16)

1. Balas E., Zemel E. An algorithm for large zero-one knapsack problems. Oper. Res. 28:1980;1130-1154.
2. A. Billionnet, Computational experience with a 1/2-approximation algorithm for the hyperbolic 0-1 knapsack problem, CEDRIC Technical Report No. 105, Conservatoire National des Arts et Métiers, Paris, 2000, 9p.
3. Dantzig G.B. Discrete variable extremum problems. Oper. Res. 5:1957;266-277.
4. Dinkelbach W. On nonlinear fractional programming. Manag. Sci. 13:1967;492-498.
5. Hansen P., Poggi de Aragao M.V., Ribeiro C.C. Hyperbolic 0-1 programming and query optimization in information retrieval. Math. Program. 52:1991;255-263.
6. Hashizume S., Fukushima M., Katoh N., Ibaraki T. Approximation algorithms for combinatorial fractional programming problems. Math. Program. 37:1987;255-267.
7. D.S. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, 1997.
8. Ishii H., Ibaraki T., Mine H. Fractional knapsack problems. Math. Program. 13:1977;255-271.
9. Lawler E.L. Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4(4):1979;339-356.
10. S. Martello, P. Toth, Knapsack Problems, Wiley, England, 1990, 296p.
11. Megiddo N. Combinatorial optimization with rational objective functions. Math. Oper. Res. 4:1979;414-424.
12. A. Nagih, Sur la résolution des problèmes fractionnaires en variables 0-1, Thèse de Doctorat, Université Paris 13, France, juin 1996.
13. Nagih A., Plateau G. A Lagrangean decomposition for the 0-1 hyperbolic programming problem. Internat. J. Math. Algorithms. 1:2000;299-314.
14. Papadimitriou C.H., Steiglitz K. Combinatorial Optimization, Algorithms and Complexity. 1982;Prentice-Hall, Englewood Cliffs, NJ.
15. Radzik T. Fractional combinatorial optimization. Du Z.-Z., Pardalos P.M. Handbook of Combinatorial Optimization. 1998;429-478 Kluwer Academic Publishers, Dordrecht.
16. Schaible S. Fractional programming. Horst R., Pardalos P. Handbook of Global Optimization. 1995;495-608 Kluwer Academic Publishers, Dordrecht.