An -approximation algorithm for a class of fractional programs

zbMATH Open1313.90229MaRDI QIDQ5497609FDOQ5497609

Authors: Peiping Shen, Yongjun Zhang 

Publication date: 11 February 2015

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

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)

Cited In (2)

• Approximation algorithms for combinatorial fractional programming problems
• Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS 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)