Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

Table 3

Updated process of the bound and gap with respect to the iterations (,).

1	60.00	0.00	60.00	100.00
2	52.75	23.20	29.55	56.01
3	45.20	26.12	19.08	42.21
4	43.53	25.40	18.13	41.64
5	38.81	34.33	4.48	11.54
6	38.87	38.87	0.00	0.00