An -approximation algorithm for a class of fractional programs

MaRDI QIDQ5497609zbMATH OpenFDO

Authors Peiping Shen, Yongjun Zhang

Publication date 11 February 2015

zbMATH Keywords

computational complexityglobal optimizationfractional programming\(\varepsilon\)-approximation algorithm

Mathematics Subject Classification ID

Fractional programming (90C32) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• An \(\varepsilon\)-approximation algorithm for generalized fractional programs
• A fully polynomial time approximation algorithm for generalized fractional programs
• An \(\varepsilon\)-approximation algorithm for generalized fractional programming problems
• A polynomial time approximation algorithm for linear fractional programs
• An efficient algorithm for solving a class of fractional programming problems

Cited in

(7)

• Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems
• Approximation algorithms for combinatorial fractional programming problems
• An efficient algorithm for solving a class of fractional programming problems
• Approximation algorithm for a class of global optimization problems
• A fully polynomial time approximation algorithm for generalized fractional programs
• An \(\varepsilon\)-approximation algorithm for generalized fractional programs
• An \(\varepsilon\)-approximation algorithm for generalized fractional programming problems

This page was built for publication: An \(\varepsilon\)-approximation algorithm for a class of fractional programs

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