The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.
Jakob BossekKatrin CaselPascal KerschkeFrank NeumannPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- search heuristics
- randomized algorithms
- undirected graph
- np hard
- constraint programming
- special case
- tabu search
- disjoint paths
- worst case
- search strategy
- minimum cost
- evolutionary algorithm
- search algorithm
- knapsack problem
- vertex cover
- beam search
- approximation ratio
- learning algorithm
- primal dual
- edge weights
- constant factor approximation
- search strategies
- search procedures
- linear programming
- polynomial time approximation
- optimal solution
- genetic algorithm
- directed graph
- heuristic search
- np complete
- active learning
- search space
- neural network