کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1141438 1489502 2014 14 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The quadratic balanced optimization problem
ترجمه فارسی عنوان
مشکل بهینه سازی متعادل درجه دوم
کلمات کلیدی
بهینه سازی ترکیبی، بهینه سازی متعادل، مشکل حلقه مشکلات باریک، اهریمنی
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات کنترل و بهینه سازی
چکیده انگلیسی


• Introduce the quadratic balanced optimization problem.
• Complexity results, algorithms, and polynomially solvable special cases.
• Experimental analysis of algorithms.

We introduce the quadratic balanced optimization problem (QBOP) which can be used to model equitable distribution of resources with pairwise interaction. QBOP is strongly NP-hard even if the family of feasible solutions has a very simple structure. Several general purpose exact and heuristic algorithms are presented. Results of extensive computational experiments are reported using randomly generated quadratic knapsack problems as the test bed. These results illustrate the efficacy of our exact and heuristic algorithms. We also show that when the cost matrix is specially structured, QBOP can be solved as a sequence of linear balanced optimization problems. As a consequence, we have several polynomially solvable cases of QBOP.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 12, May 2014, Pages 47–60
نویسندگان
, , , ,