Corrigendum to “Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem”

Table 6

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

W	U	L		Optimal path
	No	No	No	No
	41.32	40.45	2.10
	37.56	36.12	3.83
	37.56	37.56	0.00