A Benson-type algorithm for bounded convex vector optimization problems with vertex selection.
Daniel DörflerAndreas LöhneChristopher SchneiderBenjamin WeißingPublished in: Optim. Methods Softw. (2022)
Keyphrases
- optimization problems
- times faster
- globally optimal
- experimental evaluation
- cost function
- linear programming
- computational cost
- objective function
- optimal solution
- high accuracy
- learning algorithm
- k means
- search space
- preprocessing
- computational complexity
- convex hull
- detection algorithm
- optimization algorithm
- selection algorithm
- minimum weight
- segmentation algorithm
- particle swarm optimization
- bayesian networks
- similarity measure
- graph cuts
- dynamic programming
- np hard
- matching algorithm
- significant improvement
- evolutionary algorithm
- convergence rate
- optimization methods
- data structure
- piecewise linear