Geodesic
On constructing the shortest circuits on a~set of line segments
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 9 (2006) no. 3, pp. 241-252

Voir la notice de l'article provenant de la source Math-Net.Ru

This paper deals with the problem of defining the Hamiltonian cycle on segments by the ant colony algorithm. Parameters and properties of this algorithm as applied to the cutting chart for the NC machine and an arbitrary set of segments are studied. 
@article{SJVM_2006_9_3_a3,
     author = {N. D. Ganelina and V. D. Frolovskii},
     title = {On constructing the shortest circuits on a~set of line segments},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {241--252},
     publisher = {mathdoc},
     volume = {9},
     number = {3},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2006_9_3_a3/}
}
TY  - JOUR
AU  - N. D. Ganelina
AU  - V. D. Frolovskii
TI  - On constructing the shortest circuits on a~set of line segments
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2006
SP  - 241
EP  - 252
VL  - 9
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJVM_2006_9_3_a3/
LA  - ru
ID  - SJVM_2006_9_3_a3
ER  - 
%0 Journal Article
%A N. D. Ganelina
%A V. D. Frolovskii
%T On constructing the shortest circuits on a~set of line segments
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2006
%P 241-252
%V 9
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJVM_2006_9_3_a3/
%G ru
%F SJVM_2006_9_3_a3
N. D. Ganelina; V. D. Frolovskii. On constructing the shortest circuits on a~set of line segments. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 9 (2006) no. 3, pp. 241-252. http://geodesic.mathdoc.fr/item/SJVM_2006_9_3_a3/