Ratio combinatorial programs

DOI10.1016/0377-2217(94)00009-2MaRDI QIDQ1130080zbMATH OpenOpenAlexFDO

Authors Y. P. Aneja, Santosh N. Kabadi

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)

Recommendations

• Approximation algorithms for combinatorial fractional programming problems
• Combinatorial optimization with rational objective functions
• Approximation algorithms for fractional knapsack problems
• Approximating a class of combinatorial problems with rational objective function
• Approximating Rational Objectives Is as Easy as Approximating Linear Ones

Cites work

• scientific article; zbMATH DE number 3898606 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 3197631 (Why is no real title available?)
• A Fourth bibliography of fractional programming
• Approximation algorithms for combinatorial fractional programming problems
• Combinatorial Optimization with Rational Objective Functions
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Minimal ratio spanning trees
• On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming

Cited in

(14)

• Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation
• Maximizing residual flow under an arc destruction
• Adaptive local ratio
• Combinatorial optimization with rational objective functions
• Approximating a class of combinatorial problems with rational objective function
• Minmax combinatorial optimization
• A fifth bibliography of fractional programming^*
• Weighted search in the plane
• On the sum-product ratio problem and its applications
• \(\varepsilon\)-approximation minimization of convex functions in fixed dimension
• Ratio dynamic programs
• Approximating Rational Objectives Is as Easy as Approximating Linear Ones
• Flows over edge-disjoint mixed multipaths and applications
• An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme

This page was built for publication: Ratio combinatorial programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130080)