Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function.
Xavier GandibleuxFrédéric BeugniesSabine RandriamasyPublished in: 4OR (2006)
Keyphrases
- cost function
- shortest path problem
- optimization algorithm
- multi objective
- experimental evaluation
- learning algorithm
- times faster
- preprocessing
- k means
- detection algorithm
- dynamic programming
- objective function
- matching algorithm
- shortest path
- recognition algorithm
- single source
- closed form
- clustering algorithm
- expectation maximization
- particle swarm optimization
- high accuracy
- neural network
- np hard
- optimal solution
- search algorithm
- computational complexity
- bi objective
- multi objective optimization problems
- worst case
- probabilistic model
- computational cost
- search space
- image segmentation