The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance.
Kien Trung NguyenAndré B. ChasseinPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- hamming distance
- convex functions
- rooted trees
- strictly convex
- distance measure
- pattern matching
- quasiconvex
- decision trees
- convex optimization
- hash functions
- binary codes
- binary strings
- convex hull
- hamming space
- edit distance
- convex sets
- locality sensitive hashing
- objective function
- machine learning
- dimensionality reduction
- pattern recognition
- hashing methods
- binary representation
- data structure