Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm.
Tolga BektasLuis Eduardo Neves GouveiaDaniel SantosPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- directed graph
- experimental evaluation
- learning algorithm
- computational complexity
- detection algorithm
- dynamic programming
- worst case
- particle swarm optimization
- preprocessing
- recognition algorithm
- optimization algorithm
- maximum flow
- shortest path problem
- undirected graph
- graph structure
- linear programming
- k means
- optimal solution
- similarity measure
- decision trees
- cost function
- convergence rate
- evolutionary algorithm
- search space
- quadratic programming