Approximation algorithms for fractional knapsack problems

DOI10.1016/S0167-6377(02)00157-8zbMath1146.90498MaRDI QIDQ1866996

Alain Billionnet

Publication date: 2 April 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

Approximation algorithmApproximation schemeCombinatorial fractional programmingFractional knapsack problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (6)

Approximating a class of combinatorial problems with rational objective function ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Capacitated assortment and price optimization for customers with disjoint consideration sets ⋮ An approximate dynamic programming approach to convex quadratic knapsack problems ⋮ A sixth bibliography of fractional programming ⋮ The maximum ratio clique problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperbolic 0-1 programming and query optimization in information retrieval
• Fast Approximation Algorithms for Knapsack Problems
• Combinatorial Optimization with Rational Objective Functions
• An Algorithm for Large Zero-One Knapsack Problems
• Fractional knapsack problems
• Approximation algorithms for combinatorial fractional programming problems
• Discrete-Variable Extremum Problems
• On Nonlinear Fractional Programming

This page was built for publication: Approximation algorithms for fractional knapsack problems