About complexity of selection problem investment projects

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) Pub Date : 2017-09-01 DOI:10.1109/SIBIRCON.2017.8109850

S. Malakh

引用次数: 0

Abstract

Consider the two-criterion problem of maximizing benefits and minimizing risks by selecting projects. Characteristics of projects, their interference and capital are known. We have proved strongly NP-hardness in case of Boolean problem. Pseudopolynomial solvable cases were proposed.

查看原文本刊更多论文

关于投资项目选择的复杂性问题

考虑选择项目时收益最大化和风险最小化的两个标准问题。项目的特点，他们的干扰和资本是已知的。我们证明了布尔问题的强np -硬度。提出了伪多项式可解的情况。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)

自引率

0.00%

发文量