\(\varepsilon\)-approximation minimization of convex functions in fixed dimension

DOI10.1016/0167-6377(95)00028-3zbMath0855.90108OpenAlexW2033127275MaRDI QIDQ1919184

Yash P. Aneja, Santosh N. Kabadi

Publication date: 1 August 1996

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

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00028-3

zbMATH Keywords

parametric search\(\varepsilon\)-approximationpolynomial combinatorial algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items

An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme ⋮ Maximizing residual flow under an arc destruction

Cites Work

• Approximate parametric searching
• Ratio combinatorial programs
• The ellipsoid method and its consequences in combinatorial optimization
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• Combinatorial Optimization with Rational Objective Functions
• Bicriteria Transportation Problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Equivalence of \(\varepsilon\)-approximate separation and optimization in fixed dimensions.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item