An approximation algorithm for convex multi-objective programming problems.
Matthias EhrgottLizhen ShaoAnita SchöbelPublished in: J. Glob. Optim. (2011)
Keyphrases
- learning algorithm
- computational cost
- matching algorithm
- combinatorial optimization
- preprocessing
- dynamic programming
- optimal solution
- globally optimal
- k means
- benchmark problems
- objective function
- convex hull
- piecewise linear
- error bounds
- iterative algorithms
- closed form
- quadratic optimization problems
- segmentation algorithm
- worst case
- np hard
- cost function
- search space
- similarity measure
- optimization algorithm
- simulated annealing
- probabilistic model
- knapsack problem
- mathematical programming
- convex functions
- piecewise constant
- approximation schemes
- neural network