Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

Solving discrete optimization problems

Annotation

Particular cases of discrete optimization problems are studied. The classical binary knapsack problem is formulated and the Lend and Doig algorithm for its solution is considered. The shortest distance between the cities of the Tambov region is found using the Little algorithm for solving the traveling salesman problem.

Keywords

knapsack problem, Land and Doig’s algorithm, traveling salesman problem, Little’s algorithm

Full-text in one file

Download

UDC

517.97

Pages

167-177

References

1. Malyutina E.V., Pluzhnikova E.A., Filippova O.V. Fomicheva Y.G. Zadachnik-praktikum po matematicheskoy logike i diskretnoy matematike [Workbook on Mathematical Logic and Discrete Mathematics]. Tambov, Derzhavin Tambov State University Publ. House, 2015, 70 p. (In Russian). 2. Tyukhtina A.A. Metody diskretnoy optimizatsii [Discrete Optimization Methods]. Nizhny Novgorod, National Research Lobachevsky State University of Nizhny Novgorod Publ., 2014, 62 p. (In Russian). 3. Kostyuk Y.L. Effektivnaya realizatsiya algoritma resheniya zadachi kommivoyazhera [Efficient Implementation of the Algorithm for Solving the Traveling Salesman Problem]. Available at: https://www.lib.tsu.ru/mminfo/000349342 /20/image/20-078.pdf (accessed 07.10.2021). (In Russian).

Received

2021-11-05

Section of issue

Mathematics

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.