摘要
基于P-中位模型的聚类问题是一类0-1整数规划问题.本文将等式约束进行松弛,开发了一个拉格朗日启发式算法.测试了10个随机产生的问题,计算结果表明,平均对偶间隙可达到7%以内.
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 equality constraint. The computational perfomance of the method is analysed for 10 randomly qenerated problems. Computational results show that the average duality gap are within 7%.
出处
《模式识别与人工智能》
EI
CSCD
北大核心
1997年第1期33-37,共5页
Pattern Recognition and Artificial Intelligence
基金
863/CIMS主题资助项目
关键词
聚类分析
P-中粒模型
整数规划
Clustering Analysis, P-median Model, Lagrangean Relaxation, Heuristic Algorithms.
