Sibirskii Zhurnal Vychislitel'noi Matematiki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. Zh. Vychisl. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Sibirskii Zhurnal Vychislitel'noi Matematiki, 2006, Volume 9, Number 3, Pages 241–252 (Mi sjvm116)  
This article is cited in 7 scientific papers (total in 7 papers)

On constructing the shortest circuits on a set of line segments

N. D. Ganelina, V. D. Frolovskii

Novosibirsk State Technical University
Full-text PDF (479 kB) Citations (7)
References:
PDF
HTML
Abstract: 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.
Key words: ant colony, pheromone, Hamiltonian cycle.
Received: 16.01.2006
UDC: 681.2.06:687
Language: Russian
Citation: N. D. Ganelina, V. D. Frolovskii, “On constructing the shortest circuits on a set of line segments”, Sib. Zh. Vychisl. Mat., 9:3 (2006), 241–252
Citation in format AMSBIB
\Bibitem{GanFro06}
\by N.~D.~Ganelina, V.~D.~Frolovskii
\paper On constructing the shortest circuits on a~set of line segments
\jour Sib. Zh. Vychisl. Mat.
\yr 2006
\vol 9
\issue 3
\pages 241--252
\mathnet{http://mi.mathnet.ru/sjvm116}
Linking options:
  • https://www.mathnet.ru/eng/sjvm116
  • https://www.mathnet.ru/eng/sjvm/v9/i3/p241
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Sibirskii Zhurnal Vychislitel'noi Matematiki
    Statistics & downloads:
    Abstract page:647
    Full-text PDF :702
    References:41
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024