×

Found 56 Documents (Results 1–56)

Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning. (English) Zbl 1522.68499

Bergmann, Ralph (ed.) et al., KI 2022: advances in artificial intelligence. 45th German conference on AI, Trier, Germany, September 19–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13404, 160-172 (2022).
MSC:  68T07 90C27

The multiple traveling salesman problem on spiders. (English) Zbl 1490.90253

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 337-348 (2021).
Full Text: DOI

Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope. (English) Zbl 1444.90101

Khachay, Michael (ed.) et al., Mathematical optimization theory and operations research. 18th international conference, MOTOR 2019, Ekaterinburg, Russia, July 8–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11548, 374-389 (2019).
MSC:  90C27 90C59

Evolving diverse TSP instances by means of novel and creative mutation operators. (English) Zbl 1433.90128

Proceedings of the 15th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2019, Potsdam, Germany, August 27–29, 2019. New York, NY: Association for Computing Machinery (ACM). 58-71 (2019).
MSC:  90C27 68W50 90C59
Full Text: DOI

New approximation algorithms for \((1,2)\)-TSP. (English) Zbl 1499.68394

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 9, 14 p. (2018).
Full Text: DOI

Ruler of the plane – games of geometry. (English) Zbl 1432.68486

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 63, 5 p. (2017).
MSC:  68U05
Full Text: DOI

TSP with locational uncertainty: the adversarial model. (English) Zbl 1432.68508

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 32, 16 p. (2017).
MSC:  68U05 68W25 90C27

Approximating the regular graphic TSP in near linear time. (English) Zbl 1366.68365

Harsha, Prahladh (ed.) et al., 35th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2015, Bangalore, India, December 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-97-2). LIPIcs – Leibniz International Proceedings in Informatics 45, 125-135 (2015).

A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem. (English) Zbl 1369.68323

Proceedings of the 12th ACM SIGEVO workshop on foundations of genetic algorithms, FOGA 2013, Adelaide, SA, Australia, January 16–20, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1990-4). 147-160 (2013).

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software