We consider the general problem formulation as the minimization of the sum of the numbers of the feasible subset of cardinality n out of the set of N numbers. Asymmetric travelling salesman problem, assignement problem and the problem of minimization of the sum of n numbers out of the set of N numbers can be formulated in these terms. The input of all these problems can be represented as the point from the non-negative part of the unit sphere after some intuitive scaling. In this settings we assume that the retrieval of the input data is difficult. We further propose to skip the retrieval of some input numbers and substitute them with the zeros. We call this problem the problem with incomplete input. We estimate the quality of the optimal solution for the problem with incomplete input used as the solution for the problem with the complete data.

我们认为一般的问题配方基数的可行子集数的总和的最小化ñ出一整套的ñ号码。非对称旅行商问题，分配问题以及N个集合中n个数字之和的最小化问题可以用这些术语来表示数字。所有这些问题的输入都可以表示为经过一些直观缩放后来自单位球面非负部分的点。在这种设置下，我们假设输入数据的检索很困难。我们进一步建议跳过对某些输入数字的检索，并用零代替它们。我们称此问题为输入不完整的问题。我们估计输入不完整的问题的最佳解决方案的质量，将其用作具有完整数据的问题的解决方案。