A Multiple-Starting-Path Approach to the Resource-Constrained th Elementary Shortest Path Problem

Table 1

Subproblems of Lawler’s algorithm when .

			Shortest path	Cost
		No feasible path	No path	—
				5
		No feasible path	No path	—
				6
				7