Publisher
Springer International Publishing
Reference23 articles.
1. Abadi, A., Rajabioun, T., Ioannou, P.A.: Traffic flow prediction for road transportation networks with limited traffic data. IEEE Trans. Intell. Transp. Syst. 16(2), 653–662 (2015).
https://doi.org/10.1109/TITS.2014.2337238
2. Akyildiz, I.F., Lee, A., Wang, P., Luo, M., Chou, W.: A roadmap for traffic engineering in SDN-openflow networks. Comput. Netw. 71, 1–30 (2014).
https://doi.org/10.1016/j.comnet.2014.06.002
3. Altın, A., Yaman, H., Pınar, M.C.: The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations. INFORMS J. Comput. 23(1), 75–89 (2011).
https://doi.org/10.1287/ijoc.1100.0380
4. Applegate, D.L., Bixby, R.E., Chvatál, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006).
http://www.jstor.org/stable/j.ctt7s8xg
5. Avella, P., Boccia, M., Sforza, A., Vasil’ev, I.: A branch-and-cut algorithm for the median-path problem. Comput. Optim. Appl. 32(3), 215–230 (2005).
https://doi.org/10.1007/s10589-005-4800-2