Speeding up Martins' algorithm for multiple objective shortest path problems.
Sofie DemeyerJan GoedgebeurPieter AudenaertMario PickavetPiet DemeesterPublished in: 4OR (2013)
Keyphrases
- shortest path problem
- multiple objectives
- shortest path
- dynamic programming
- learning algorithm
- preprocessing
- optimal solution
- cost function
- computational cost
- detection algorithm
- matching algorithm
- combinatorial optimization
- combinatorial optimization problems
- np hard
- computational complexity
- objective function
- linear programming problems
- worst case
- neural network
- ant colony optimization
- region of interest
- single source