An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme

DOI10.1016/S0020-0190(97)00142-7zbMath1337.90085MaRDI QIDQ290269

Yash P. Aneja, Santosh N. Kabadi

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Newton's methodcombinatorial problemsapproximation algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate parametric searching
• Ratio combinatorial programs
• \(\varepsilon\)-approximation minimization of convex functions in fixed dimension
• Combinatorial Optimization with Rational Objective Functions
• Using separation algorithms in fixed dimension

This page was built for publication: An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme