.png){kind=icon}
返回
Integer programming models for the q-mode problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.08.039.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The q-mode problem is a combinatorial optimization problem that requires partitioning of objects into clusters. We discuss theoretical properties of an existing mixed integer programming (MIP) model for this problem and offer alternative models and enhancements. Through a comprehensive experiment we investigate computational properties of these MIP models. This experiment reveals that, in practice, the MIP approach is more effective for instances containing strong natural clusters and it is not as effective for instances containing weak natural clusters. The experiment also reveals that one of the MIP models that we propose is more effective than the other models for solving larger instances of the problem. (C) 2006 Elsevier B.V. All rights reserved.
Keyword:
integer programming
linear programming
cluster analysis
data mining
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Potential Negative Consequences of Adding Phosphorus‐Based Fertilizers to Immobilize Lead in Soil
PREAI
分享收藏
没有更多内容
没有更多内容