کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4641961 | 1632054 | 2008 | 18 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: A discrete filled function algorithm for approximate global solutions of max-cut problems A discrete filled function algorithm for approximate global solutions of max-cut problems](/preview/png/4641961.png)
A discrete filled function algorithm is proposed for approximate global solutions of max-cut problems. A new discrete filled function is defined for max-cut problems and the properties of the filled function are studied. Unlike general filled function methods, using the characteristic of max-cut problems, the parameters in proposed filled function need not be adjusted. This greatly increases the efficiency of the filled function method. By combining a procedure that randomly generates initial points for minimization of the filled function, the proposed algorithm can greatly reduce the calculation cost and be applied to large scale max-cut problems. Numerical results on different sizes and densities test problems indicate that the proposed algorithm is efficient and stable to get approximate global solutions of max-cut problems.
Journal: Journal of Computational and Applied Mathematics - Volume 220, Issues 1–2, 15 October 2008, Pages 643–660