Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2019 / Article

Corrigendum | Open Access

Volume 2019 |Article ID 9640708 | 2 pages | https://doi.org/10.1155/2019/9640708

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

Received31 Jul 2019
Accepted31 Jul 2019
Published04 Sep 2019

In the article titled “Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem” [1], there were errors in Tables 5, 6, and 8, as follows:(i)In Table 5, the values included in its first and last columns, except for the first cell in the latter, were incorrect.(ii)In Table 6, the values included in the last two cells in its last column were incorrect.(iii)In Table 8, the value included in the second cell in its last column was incorrect.

The corrected tables are shown below.


ODULOptimal path

41.3240.452.10
61.9458.874.95
57.3155.62.98
56.4355.51.64
59.2457.912.24
51.6650.023.17
40.6040.600.00
49.1346.894.55
49.0849.080.00
52.1451.231.74


WULOptimal path

NoNoNoNo
41.3240.452.10
37.5636.123.83
37.5637.560.00


WULOptimal path

72.4470.392.83
61.9458.874.95
57.1254.394.77
53.2053.200.00

References

  1. Y. Pan, “Lagrangian relaxation for the multiple constrained robust shortest path problem,” Mathematical Problems in Engineering, vol. 2019, Article ID 3987278, 13 pages, 2019. View at: Publisher Site | Google Scholar

Copyright © 2019 Yiyong Pan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

220 Views | 167 Downloads | 0 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.