Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction
From MaRDI portal
Publication:5881167
DOI10.1007/978-3-319-91262-2_48MaRDI QIDQ5881167
Antoni Ligȩza, Krystian Jobczyk, Piotr Wiśniewski
Publication date: 9 March 2023
Published in: Artificial Intelligence and Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-91262-2_48
90C27: Combinatorial optimization
03B70: Logic in computer science
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Euclidean traveling salesman problem is NP-complete
- Better approximations for max TSP
- A unified solution framework for multi-attribute vehicle routing problems
- The Truck Dispatching Problem
- A propositional modal logic of time intervals
- Dynamic Epistemic Preferential Logic of Action
- New Bounds for the Traveling Salesman Constant
- The Traveling-Salesman Problem