.png){kind=icon}
返回
Integer-friendly formulations for the r-separation problem
.png){kind=icon}
OA
AI
DOI：10.1016/0377-2217(94)00348-3.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider different formulations for the r-separation problem, where the objective is to choose as many points as possible from a given set of points subject to the constraint that no two selected points can be closer than r units to one another. Our goal is to devise a mathematical programming formulation with an LP-relaxation which yields integer solutions with great frequency. We consider six different formulations of the r-separation problem. We show that the LP-relaxations of the most obvious formulations will yield fractional results in all instances of the problem if an optimal solution contains fewer than half of the given points. To build computationally effective formulations for the r-separation problem, we write dense constraints with unit right-hand-sides. The LP formulation that performs the best in our computational tests almost always finds 0-1 solutions to the problem.
Keyword:
r-separation
independent set
integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Deplacement chimique des protons d'heterocycles etudies par resonance magnetique nucleaire.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏Comparing SSB-PriA Functional and Physical Interactions in Gram-Positive and -Negative Bacteria
PREAI
分享收藏
查看更多内容