SPPRCLIB

This page contains a collection of shortest path problems with resource constraints.

Instances with a single capacity constraint can be found here. Results are available in the paper:

• M. Jepsen, B. Petersen, and S. Spoorendonk. A Branch-and-Cut Algorithm for the Elementary Shortest PathProblem with a Capacity Constraint. Technical Report 08/01, DIKU, University of Copenhagen, Denmark, 2008.   [BibTeX]   [Google]   [pdf]