.png){kind=icon}
.png){kind=icon}
Return
A multiple penalty function method for solving Max-Bisection problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2005.04.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
Max-Bisection problem
multiple penalty function
NCP function
circuit partitioning problem
semidefinite programming
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available