.png){kind=icon}
返回
An algorithm for a selection procedure
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00409-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
When we have a selection problem that involves qualitative information, we can use the qualitative programming method and find the optimal choice by using integer programming. However, in practice after formulation of the problem we have a large scale model. In this note we introduce a very effective method for solving a qualitative programming problem. The only operations used in this method are scalar and matrix addition, and hence for problems of reasonable size, the method does not need high speed computers, and can be supplemented using hand calculators. (C) 2001 Elsevier Science B.V. All rights reserved.
Keyword:
selection problem
qualitative programming problem
optimal choice
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
.png){kind=icon}
