Výsledky vyhľadávania - "k-Opt algorithm"

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$

Autori: Heimann, Sophia Hoang, Hung P. Hougardy, Stefan a ďalší

Prispievatelia: Heimann, Sophia Hoang, Hung P. Hougardy, Stefan a ďalší

Predmety: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.2.1, G.2.2, F.2.2, 7. Clean energy, Traveling Salesman Problem, PLS-completeness, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, 68W25, 68W40, 68Q25, 90C27, k-Opt algorithm, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2402.07061
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.84

On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP

Autori: Zhong, Xianghui Xianghui Zhong

Prispievatelia: Zhong, Xianghui Xianghui Zhong

Predmety: traveling salesman problem, metric TSP, graph TSP, k-Opt algorithm, Lin-Kernighan algorithm, approximation algorithm, approximation ratio

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.83

Dostupnosť: https://doi.org/10.4230/LIPIcs.ESA.2020.83
https://nbn-resolving.org/urn:nbn:de:0030-drops-129497
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.83

A Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem

Autori: Erchong Liao Changan Liu

Zdroj: IEEE Access, Vol 6, Pp 38921-38933 (2018)

Predmety: Ant colony optimization, density peaks clustering algorithm, traveling salesman problem, 0202 electrical engineering, electronic engineering, information engineering, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, k-Opt algorithm, TK1-9971, 3. Good health

Prístupová URL adresa: https://doaj.org/article/93ce71a252084436aa2eb391331cd088
https://dblp.uni-trier.de/db/journals/access/access6.html#LiaoL18
https://ieeexplore.ieee.org/document/8404041

Approximation Algorithms for the Traveling Salesman Problem

Autori: Zhong, Xianghui Hougardy, Stefan Röglin, Heiko

Prispievatelia: Zhong, Xianghui Hougardy, Stefan Röglin, Heiko

Predmety: Traveling Salesman Problem, Approximation Algorithms, k-Opt Algorithm, Lin-Kernighan Algorithm, Approximation Ratio, Subtour LP, Integrality Ratio, ddc:510

Popis súboru: application/pdf

Relation: info:eu-repo/semantics/altIdentifier/urn/urn:nbn:de:hbz:5-61854; https://hdl.handle.net/20.500.11811/9076

Dostupnosť: https://hdl.handle.net/20.500.11811/9076