| NP-hard problems are very popular in industrial applications, so it is very significant. The thesis studies the circle packing problem. Firstly, the method constructs an equivalent semidefinite programming relaxation model, then the global solution is obtained combined with the nonlinear programming local optimization method. The numerical examples show that the method is efficient.
|
PDF Full Text Request