1. A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. (May 2015) Authors: Sedeño-Noda, Antonio; Raith, Andrea Journal: Computers & operations research Issue: Volume 57(2015) Page Start: 83 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗