-
65浏览
-
0点赞
-
0收藏
-
0分享
-
207下载
-
0评论
-
引用
期刊论文
A multiple penalty function method for solving Max-Bisection problems☆
Applied Mathematics and Computation 173(2006)757-766,-0001,():
A continuation algorithm for the solution of Max-Bisection problems is proposed in this paper. Unlike available relaxation algorithms for Max-Bisection problems, the Max-Bisection problems are converted to an equivalent continuous nonlinear programming by employing NCP functions, and the resulting nonlinear programming problem is then solved using the augmented Lagrange penalty function method. The convergence property and finite termination property of the proposed algorithm are studied, and numerical experiments and comparisons on the simple circuit partitioning problems are made. Results reported in section "Numerical experiments" show the algorithm generates satisfactory solutions to test problems.
【免责声明】以下全部内容由[徐成贤]上传于[2006年09月07日 02时00分58秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果