کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1142421 957147 2013 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
چکیده انگلیسی

We consider the problem of minimizing a class of quasi-concave functions over a convex set. Quasi-concave functions are generalizations of concave functions and NP-hard to minimize in general. We present a simple fully polynomial time approximation scheme (FPTAS) for minimizing a class of low-rank quasi-concave functions. Our algorithm solves a polynomial number of linear minimization problems and computes an extreme point near-optimal solution. Therefore, it applies directly to combinatorial 00-11 problems where the convex hull of feasible solutions is known.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 41, Issue 2, March 2013, Pages 191–196
نویسندگان
, ,