论文标题
间隔的贪婪算法，用于间隔目标功能的离散优化问题
The interval greedy algorithm for discrete optimization problems with interval objective function
论文作者
论文摘要
我们考虑具有间隔目标函数的一系列离散优化问题。我们对问题进行了贪婪算法的概括。使用算法，我们获得了所有可能的贪婪解决方案的集合以及解决方案目标函数的所有可能值的集合。对于目标函数系数间隔的给定概率分布，我们计算解决方案的概率，请计算其目标函数的预期值以及问题的其他概率特征。
We consider a wide class of the discrete optimization problems with interval objective function. We give a generalization of the greedy algorithm for the problems. Using the algorithm, we obtain the set of all possible greedy solutions and the set of all possible values of the objective function for the solutions. For a given probability distribution on intervals of objective function' coefficients, we compute probabilities of the solutions, compute expected values of the objective function for them and other probabilistic characteristics of the problem.
