A Support-Based Algorithm for the Bi-Objective Pareto Constraint.
Renaud HartertPierre SchausPublished in: AAAI (2014)
Keyphrases
- bi objective
- multi objective
- cost function
- computational complexity
- dynamic programming
- optimization algorithm
- np hard
- multi objective optimization
- computationally efficient
- ant colony optimization
- search space
- evolutionary algorithm
- worst case
- combinatorial optimization
- linear programming
- global optimization
- convex hull
- particle swarm optimization
- neural network
- objective function