|
|
|
A. A. Bosov,A. V. G?rb?v?,N. V. Khalipova
Pág. 170 - 175
Introduction: Formed knapsack problem in terms of set functions and is a heuristic algorithm. The goal: to prove that the heuristic algorithm is essential. Some facts from [2]. The equivalence of the limit order to E.Borelyu and convergence in measure. T...
ver más
|
|
|