.png){kind=icon}
返回
Conflict graphs in solving integer programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00015-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We report on the use of conflict graphs in solving integer programs. A conflict graph represents logical relations between binary variables. We develop algorithms and data structures that allow the effective and efficient construction, management, and use of dynamically changing conflict graphs. Our computational experiments show that the techniques presented work very well. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
conflict graphs
integer programming
cliques
preprocessing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Primate-like retinotectal decussation in an echolocating megabat, Rousettus aegyptiacus.png)
Neuroscience
NeuroscienceIF0
PREAI
分享收藏
分享收藏
分享收藏
查看更多内容