An efficient algorithm for finding a path subject to two additive constraints

Turgay Korkmaz, Marwan M. Krunz, and S. Tragoudas
Computer Commun. 25(3):225–238, Feb 2002

Cites:

Finding the $k$ shortest paths

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