摘要
Clusting problem based on P-Median may be formulated a as 0-1 interger programming problem. In this paper we develop a Lagrangean heuristic algorithms based on relaxation of the inequality constraint. The computational performance of the method is analysed for 10 problems. Computational results show that the average duality gap are within 2%.
Clusting problem based on P-Median may be formulated a as 0-1 interger programming problem. In this paper we develop a Lagrangean heuristic algorithms based on relaxation of the inequality constraint. The computational performance of the method is analysed for 10 problems. Computational results show that the average duality gap are within 2%.
出处
《数值计算与计算机应用》
CSCD
北大核心
1997年第3期167-172,共6页
Journal on Numerical Methods and Computer Applications
