Evaluating the Difficulty of Instances of the Travelling Salesman Problem in the Nearby of the Optimal Solution Based on Random Walk Exploration.
Miguel Cárdenas-MontesPublished in: HAIS (2016)
Keyphrases
- random walk
- optimal solution
- quadratic assignment problem
- directed graph
- np hard
- transition probabilities
- lower bound
- markov chain
- knapsack problem
- linear programming
- link prediction
- search space
- spectral methods
- objective function
- multi db
- markov random walk
- linear program
- solution quality
- branch and bound
- lp relaxation
- transition probability matrix
- feasible solution
- social networks
- pairwise
- branch and bound algorithm
- stationary distribution
- proximity measures
- reinforcement learning
- similarity measure
- clustering algorithm