THREE 'GREEDY' ALGORITHMS
| Autor: | V. F. Ochkov, M. D. Alekseev, A. O. Ivanova |
|---|---|
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | Informatics in school. :34-42 |
| ISSN: | 2221-1993 |
| Popis: | The article considers three logistic tasks (transportation problem, traveling salesman problem, pursuit problem), by the example of which the essence and features of “greedy” algorithms are shown. For the frst time, a solution was given to a transportation problem in the Mathcad Prime environment using the matrix method using units of measure. Two new applications of the traveling salesman problem have been proposed. The difference scheme for solving the pursuit problem is described. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|