The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics.
Jakob BossekKatrin CaselPascal KerschkeFrank NeumannPublished in: GECCO (2020)
Keyphrases
- approximation algorithms
- search heuristics
- randomized algorithms
- constraint programming
- np hard
- undirected graph
- special case
- disjoint paths
- search strategy
- knapsack problem
- vertex cover
- beam search
- search algorithm
- tabu search
- worst case
- primal dual
- minimum cost
- evolutionary algorithm
- constant factor
- genetic algorithm
- search strategies
- directed graph
- learning algorithm
- constraint satisfaction
- approximation ratio
- polynomial time approximation
- branch and bound algorithm
- graph structure
- search space
- edge weights
- heuristic search
- search procedures
- orders of magnitude
- wireless sensor networks
- machine learning