Login / Signup
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem.
Antonio Sedeño-Noda
Andrea Raith
Published in:
Comput. Oper. Res. (2015)
Keyphrases
</>
shortest path problem
bi objective
objective function
optimization algorithm
hybrid method
computational complexity
cost function
scheduling problem
single source
neural network
genetic algorithm
computational efficiency