极端强分支用于QCQP
Extreme Strong Branching for QCQPs
AI总结:
针对QCQP问题,提出极端强分支方法,通过联合选择分支变量与分支点,利用边界收紧,实验证明优于商业求解器。
摘要:
对于混合整数规划(MIP),强分支是一种高效变量选择方法,可减少分支定界算法中的节点数。将其扩展到非线性问题在概念上简单但实际受限。对二元变量分支将变量固定为0或1,而对连续变量分支则需要额外决策来选择分支点。先前的强分支扩展预定义该点,然后求解$2n$个松弛问题,其中$n$是候选分支变量数。我们提出极端强分支,它评估每个变量的多个分支点,并基于目标值改进联合选择分支变量和分支点。该方法类似于强分支在MIP中的成功,同时额外利用边界收紧作为副产品。对于某些类型的二次约束二次规划(QCQP),计算实验表明极端强分支规则优于现有商业求解器。
英文摘要:
For mixed-integer programs (MIPs), strong branching is a highly effective variable selection method to reduce the number of nodes in the branch-and-bound algorithm. Extending it to nonlinear problems is conceptually simple but practically limited. Branching on a binary variable fixes the variable to 0 or 1, whereas branching on a continuous variable requires an additional decision to choose a branching point. Previous extensions of strong branching predefine this point and then solve $2n$ relaxations where $n$ is the number of candidate variables to branch. We propose extreme strong branching, which evaluates multiple branching points per variable and jointly selects both the branching variable and point based on the objective value improvement. This approach resembles the success of strong branching for MIPs while additionally exploiting bound tightening as a byproduct. For certain types of quadratically constrained quadratic programs (QCQPs), computational experiments show that the extreme strong branching rule outperforms existing commercial solvers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。