The quadratic balanced optimization problem
Optimization and Control
2013-08-15 v2 Discrete Mathematics
Combinatorics
Abstract
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.
Cite
@article{arxiv.1212.4211,
title = {The quadratic balanced optimization problem},
author = {Abraham P. Punnen and Sara Taghipour and Daniel Karapetyan and Bishnu Bhattacharyya},
journal= {arXiv preprint arXiv:1212.4211},
year = {2013}
}
Comments
26 pages