An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set

DOI10.1016/j.orl.2013.01.004zbMath1262.90135OpenAlexW2085034315MaRDI QIDQ1949686

R. Ravi, Vineet Goyal

Publication date: 14 May 2013

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

Full work available at URL: https://figshare.com/articles/journal_contribution/An_FPTAS_for_Minimizing_a_Class_of_Low-Rank_Quasi-Concave_Functions_over_a_Convex_Set/6703709

zbMATH Keywords

non-convex programmingnon-linear programmingpolynomial approximation schemesquasi-concave programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ A new Lagrangian-Benders approach for a concave cost supply chain network design problem ⋮ Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints ⋮ An FPTAS for optimizing a class of low-rank functions over a polytope ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Pricing Toll Roads under Uncertainty ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Linear decomposition approach for a class of nonconvex programming problems ⋮ A PTAS for a class of binary non-linear programs with low-rank functions ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem ⋮ A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing

This page was built for publication: An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set