【摘要】 最大团问题是一个经典的组合优化问题.在Motzkin和Straus的二次规划模型基础上,给出一种求解该问题的D函数正则化算法.通过引进D函数可以改善问题的凸性.几个标准考题的计算结果表明,该算法稳定有效.更多还原

【Abstract】 The maximum clique is a typical problem of combinatorial optimization.Based on the quadratic model given by Motzkin and Straus,we propose a distance function regularization approach to its solution.The introduction of distance function is to improve the convexity of original problem.Computational results for some standard test problems show that our method is stable and effective.更多还原