Searching Extreme Paths Based on Travelling Salesman’s Problem for Wireless Emerging Networking-Reference-Cited by-同舟云学术

Searching Extreme Paths Based on Travelling Salesman’s Problem for Wireless Emerging Networking

Published:2023 Issue: Volume: Page:284-304
ISSN:1876-1100
Container-title:Emerging Networking in the Digital Transformation Age
language:
Short-container-title:

Author:

Pavlenko Oleh^ORCID,Tymoshenko Anatolii^ORCID,Tymoshenko Oksana,Luntovskyy Andriy^ORCID,Pyrih Yaroslav,Melnyk Igor^ORCID

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-24963-1_16

Reference22 articles.

1. Deo, N.: Graph Theory with Applications to Engineering and Computer Science (Dover Books on Mathematics), 1st edn. Dover Publications (2016)

2. Benjamin, A., Chartrand, G., Zhang, P.: The Fascinating World of Graph Theory by Arthur Benjamin. Princeton University Press (2017)

3. Kostenko, L.I., Tymoshenko, A.G., Traynin, E.Z.: Electronic modeling of operations research tasks. Academy of Sciences of Ukraine, Institute of Cybernetics. Sciences, p. 163 (1973)

4. Dibrova, M.O: The method of forming non-intersecting paths in software-configured networks. Bull. Univ. “Ukraine” Inf. Comput. Cybern 1(18), 131–136 (2017)

5. Rego, C., Gamboa, D., Glover, F., Osterman, C.: Traveling salesman problem heuristics: Leading methods, implementations and latest advances. European Journal of Operational Research 211(3), 427–441 (2011)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. GENETIC ALGORITHM AS A TOOL FOR SOLVING OPTIMISATION PROBLEMS;Information and communication technologies, electronic engineering;2023-09