.png){kind=icon}
返回
Perfect, ideal and balanced matrices
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(00)00056-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we survey results and open problems on perfect, ideal and balanced matrices. These matrices arise in connection with the set packing and set covering problems, two integer programming models with a wide range of applications. We concentrate on some of the beautiful polyhedral results that have been obtained in this area in the last 30 years. This survey first appeared in Ricerca Operativa. (C) 2001 Elsevier Science B.V. All rights reserved.
Keyword:
set covering problem
ideal matrix
set packing problem
perfect graph
balanced matrix
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容