Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

Table 7

Computational results of the upper bound, lower bound, and relation gap with respect to the different constraints ().

				Optimal path
	NO	NO	NO	NO
	51.31	51.48	-0.03
	33.49	33.49	0.00
	33.49	33.49	0.00