|
License Agreement on scientific materials use.
|
PROPERTIES OF HAMILTONIAN NETWORKS USED IN DEVELOPMENT OF SOFTWARE FOR SPECIAL-PURPOSE COMMUNICATION NETWORKS
|
Ivan Ivanovich Gorai
S. M. Budjonny Military Academy of the Signal Corps in Saint Petersburg
Dmitrii Anatol'evich Zhuravlev
S. M. Budjonny Military Academy of the Signal Corps in Saint Petersburg
|
|
Submitted:
December 16, 2015
|
|
Abstract.
The article reveals the possibility of the development of the software used in the planning and operation of special-purpose networks. The focus of the authors’ attention is on the application of the designed for these purposes algorithm and code for solving the Travelling Salesman Problem, as well as the tester of evaluating the efficiency of their work. The paper gives the general properties of Hamiltonian networks allowing modifying original data in the process of the software testing.
|
Key words and phrases:
алгоритм
программное обеспечение
задача «Коммивояжер»
приближенное решение
тестирование
algorithm
software
Travelling Salesman Problem
approximate solution
testing
|
|
Open
the whole article in PDF format. Free PDF-files viewer can be downloaded here.
|
|
References:
- Гэри М., Джонсон Д. Вычислительные машины и труднорешаемые задачи / пер. с англ. М.: Мир, 1982. 416 с.
- Кнут Д. Искусство программирования для ЭВМ: в 3-х т. М.: Мир, 1976. Т. 1. Основные алгоритмы. 720 с.
- Кристофиденс Н. Теория графов. Алгоритмический подход. М.: Мир, 1978. 429 с.
- Кук С. А. Сложность процедур вывода теорем // Кибернетический сборник. Новая серия. 1975. Вып. 12. С. 5-15.
|
