Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach

Matthias Ehrgott and A. J. V. Skriver
Eur. J. Operational Research 147(3):657–664, Jun 2003

Cites:

Finding the $k$ shortest paths

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine