.png){kind=icon}
返回
AN ALGORITHM OF INTERNAL FEASIBLE DIRECTIONS FOR LINEAR INTEGER PROGRAMMING
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(91)90081-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An approximate algorithm for solving pure interger problems is examined. The algorithm belongs to the class of component algorithms using feasible integer directions. The basic characteristics of the algorithm are analyzed. Testing on an IBM/PC/AT personal computer is carried out. The proposed algorithm is compared with other well known approximate algorithms
Keyword:
OPTIMIZATION
INTEGER PROGRAMMING
APPROXIMATE ALGORITHM
HEURISTICS
COMPUTATIONAL ANALYSIS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Screening and identification of tobacco mutants resistant to tobacco and cucumber mosaic viruses
PREAI
分享收藏
Translation, Validation and Cross-Cultural Adaptation of a Simplified-Chinese Version of the Tegner Activity Score in Chinese Patients with Anterior Cruciate Ligament Injury.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏
查看更多内容