On the feasible set for the squared Euclidean Weber problem and applications.
Zvi DreznerCarlton H. ScottPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- feasible set
- euclidean distance
- variational inequalities
- nonlinear programming problems
- objective function
- convex sets
- feasible solution
- newton method
- strictly convex
- convex hull
- least squares
- euclidean space
- distance measure
- tabu search
- optimality conditions
- feature vectors
- finite number
- sensitivity analysis
- optimal solution
- metaheuristic
- linear programming
- dynamic programming
- search algorithm
- distance function
- dimensionality reduction
- data points