Double bound method for solving the p-center location problem.
Hatice CalikBarbaros C. TanselPublished in: Comput. Oper. Res. (2013)
Keyphrases
- center location
- high accuracy
- significant improvement
- objective function
- pairwise
- training set
- cost function
- dynamic programming
- mathematical model
- optimization algorithm
- clustering method
- d objects
- upper bound
- genetic algorithm
- classification accuracy
- matching algorithm
- classification method
- lower bound
- fully automatic
- segmentation method
- detection method
- support vector machine
- support vector machine svm
- worst case
- knn
- computational cost
- experimental evaluation
- prior knowledge
- decision trees
- feature selection