二次组合最优化问题的表示:使用二次集合覆盖问题的实例研究
Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem
摘要:
二次组合最优化问题(QCOP)的目标函数可以由两个数据点表示,二次成本矩阵Q和线性成本向量c。对于相同的QCOP,对(Q,c)的不同但等价的表示在文献中是众所周知的。研究论文经常指出,在不失一般性的情况下,我们假设Q是对称的,或上三角形或半正定的,等等。流行的通用0-1 QCOP求解器,如GUROBI和CPLEX,并没有提出Q和c的首选表示。我们的实验分析表明,GUROBI更喜欢上三角表示的矩阵Q,而CPLEX更喜欢对称表示在统计上显着的方式。等价表示虽然保持了最优性,但它们可能会改变由各种下界方案获得的相应下界值。对于自然的下界的QCOP,对称表示产生更严格的界限,一般。CPLEX和GUROBI在启发式模式下运行时的等效表示的效果也进行了探索。此外,我们回顾了各种等价表示的QCOP从文献中有理论基础被视为强大的,并提供新的理论见解,产生这样的等价表示利用常值属性和对角化(线性化)的QCOP实例。
英文摘要:
The objective function of a quadratic combinatorial optimization problem (QCOP) can be represented by two data points, a quadratic cost matrix Q and a linear cost vector c. Different, but equivalent, representations of the pair (Q, c) for the same QCOP are well known in literature. Research papers often state that without loss of generality we assume Q is symmetric, or upper-triangular or positive semidefinite, etc. These representations however have inherently different properties. Popular general purpose 0-1 QCOP solvers such as GUROBI and CPLEX do not suggest a preferred representation of Q and c. Our experimental analysis discloses that GUROBI prefers the upper triangular representation of the matrix Q while CPLEX prefers the symmetric representation in a statistically significant manner. Equivalent representations, although preserve optimality, they could alter the corresponding lower bound values obtained by various lower bounding schemes. For the natural lower bound of a QCOP, symmetric representation produced tighter bounds, in general. Effect of equivalent representations when CPLEX and GUROBI run in a heuristic mode are also explored. Further, we review various equivalent representations of a QCOP from the literature that have theoretical basis to be viewed as strong and provide new theoretical insights for generating such equivalent representations making use of constant value property and diagonalization (linearization) of QCOP instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。