Matthias Müller-Hannemann Karsten Weihe Pareto Shortest Paths is Often Feasible in Practice. 185-198 2001 conf/wae/2001 Algorithm Engineering http://link.springer.de/link/service/series/0558/bibs/2141/21410185.htm db/conf/wae/wae2001.html#Muller-HannemannW01