Substantiation of a heuristic algorithm in the knapsack problem
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. The theorem about the need to set a maximum of...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Dnipro National University of Railway Transport named after Academician V. Lazaryan
2012-12-01
|
| Series: | Nauka ta progres transportu |
| Subjects: | |
| Online Access: | http://stp.diit.edu.ua/article/view/9390/8150 |