Ratio combinatorial programs

DOI10.1016/0377-2217(94)00009-2zbMath0906.90144OpenAlexW1996856745MaRDI QIDQ1130080

Santosh N. Kabadi, Yash P. Aneja

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00009-2

zbMATH Keywords

\(\varepsilon\)-approximate knapsackparameterized linear objective functionratio of two linear functions

Mathematics Subject Classification ID

Fractional programming (90C32) Combinatorial optimization (90C27)

Related Items

An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme ⋮ A fifth bibliography of fractional programming^* ⋮ Maximizing residual flow under an arc destruction ⋮ Flows over edge-disjoint mixed multipaths and applications ⋮ \(\varepsilon\)-approximation minimization of convex functions in fixed dimension ⋮ Minmax combinatorial optimization ⋮ Weighted search in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial Optimization with Rational Objective Functions
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Minimal ratio spanning trees
• A Fourth bibliography of fractional programming
• Approximation algorithms for combinatorial fractional programming problems
• On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming