Temporal Traveling Salesman Problem - in a Logic- and Graph Theory-Based Depiction.
Krystian JobczykPiotr WisniewskiAntoni LigezaPublished in: ICAISC (2) (2018)
Keyphrases
- graph theory
- traveling salesman problem
- combinatorial optimization
- minimum spanning tree
- graph theoretical
- combinatorial problems
- optimization problems
- ant colony optimization
- branch and bound
- traveling salesman
- graph theoretic
- social network analysis
- computer vision and pattern recognition
- crossover operator
- automata theory
- complex networks
- metaheuristic
- hamiltonian cycle
- discrete particle swarm optimization
- maximal cliques
- discrete optimization problems
- simulated annealing
- neural network
- ant colony optimization algorithm
- genetic local search
- graph based representations
- branch and bound algorithm
- graph coloring
- message passing
- vehicle routing problem
- global optimization
- lower bound