{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:17Z","timestamp":1740145157950,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,6,20]],"date-time":"2016-06-20T00:00:00Z","timestamp":1466380800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Islamic Azad University, Kashan Branch"},{"DOI":"10.13039\/501100007251","name":"National Research University Higher School of Economics (RU)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007251","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s11590-016-1051-3","type":"journal-article","created":{"date-parts":[[2016,6,20]],"date-time":"2016-06-20T07:28:49Z","timestamp":1466407729000},"page":"429-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A robust optimization approach for multicast network coding under uncertain link costs"],"prefix":"10.1007","volume":"11","author":[{"given":"H.","family":"Ghasvari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A.","family":"Raayatpanah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3303-0981","authenticated-orcid":false,"given":"P. M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,20]]},"reference":[{"issue":"4","key":"1051_CR1","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1051_CR2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"SYR Li","year":"2003","unstructured":"Li, S.Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Trans. Inf. Theory 49(2), 371\u2013381 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1051_CR3","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","volume":"51","author":"S Jaggi","year":"2005","unstructured":"Jaggi, S., Sanders, P., Chou, P.A., Effros, M., Egner, S., Jain, K., Tolhuizen, L.M.G.M.: Polynomial time algorithms for multicast network code construction. IEEE Trans. Inf. Theory 51(6), 1973\u20131982 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1051_CR4","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R Koetter","year":"2003","unstructured":"Koetter, R., M\u00e9dard, M.: An algebraic approach to network coding. IEEE\/ACM Trans. Netw. 11(5), 782\u2013795 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"1051_CR5","doi-asserted-by":"crossref","first-page":"2608","DOI":"10.1109\/TIT.2006.874523","volume":"52","author":"DS Lun","year":"2006","unstructured":"Lun, D.S., Ratnakar, N., M\u00e9dard, M., Koetter, R., Karger, D.R., Ho, T., Ahmed, E., Zhao, F.: Minimum-cost multicast over coded packet networks. IEEE Trans. Inf. Theory 52(6), 2608\u20132623 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1051_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0311-1","volume-title":"Mathematical Aspects of Network Routing Optimization","author":"CAS Oliveira","year":"2011","unstructured":"Oliveira, C.A.S., Pardalos, P.M.: Mathematical Aspects of Network Routing Optimization. Springer, Berlin (2011)"},{"key":"1051_CR7","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1016\/j.comnet.2012.11.017","volume":"57","author":"MA Raayatpanah","year":"2012","unstructured":"Raayatpanah, M.A., Salehi Fathabadi, H., Khalaj, B.H., Khodayifar, S.: Minimum cost multiple multicast network coding with quantized rates. Comput. Netw. 57, 1113\u20131123 (2012)","journal-title":"Comput. Netw."},{"key":"1051_CR8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.jnca.2013.12.004","volume":"41","author":"MA Raayatpanah","year":"2014","unstructured":"Raayatpanah, M.A., Salehi Fathabadi, H., Khalaj, B.H., Khodayifar, S., Pardalos, P.M.: Bounds on end-to-end statistical delay and jitter in multiple multicast coded packet networks. J. Netw. Comput. Appl. 41, 217\u2013227 (2014)","journal-title":"J. Netw. Comput. Appl."},{"key":"1051_CR9","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: Linear programming under uncertainty. In: Infanger, G. (ed.) Stochastic Programming, pp. 1\u201311. Springer, New York (2011)","DOI":"10.1007\/978-1-4419-1642-6_1"},{"key":"1051_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Berlin (2011)"},{"issue":"5","key":"1051_CR11","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5), 1154\u20131157 (1973)","journal-title":"Oper. Res."},{"issue":"4","key":"1051_CR12","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1287\/opre.24.4.783","volume":"24","author":"JE Falk","year":"1976","unstructured":"Falk, J.E.: Exact solutions of inexact linear programs. Oper. Res. 24(4), 783\u2013787 (1976)","journal-title":"Oper. Res."},{"issue":"4","key":"1051_CR13","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23(4), 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1051_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1051_CR15","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88(3), 411\u2013424 (2000)","journal-title":"Math. Program."},{"issue":"1","key":"1051_CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1052623496305717","volume":"9","author":"L Ghaoui El","year":"1998","unstructured":"El Ghaoui, L., Oustry, F., Lebret, H.: Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9(1), 33\u201352 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1051_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"1051_CR18","doi-asserted-by":"crossref","unstructured":"Fan, N., Pardalos, P.M.: Robust optimization of graph partitioning and critical node detection in analyzing networks. In: Wu, W., Daescu, O. (eds.) Combinatorial Optimization and Applications, pp. 170\u2013183. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-17458-2_15"},{"key":"1051_CR19","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2011.10.015","volume":"447","author":"N Fan","year":"2012","unstructured":"Fan, N., Zheng, Q.P., Pardalos, P.M.: Robust optimization of graph partitioning involving interval uncertainty. Theor. Comput. Sci. 447, 53\u201361 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1051_CR20","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.ejor.2013.02.037","volume":"229","author":"GP Georgiev","year":"2013","unstructured":"Georgiev, G.P., Luc, D.T., Pardalos, P.M.: Robust aspects of solutions in deterministic multiple objective linear programming. Eur. J. Oper. Res. 229(1), 29\u201336 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1051_CR21","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10479-012-1303-2","volume":"216","author":"P Xanthopoulos","year":"2014","unstructured":"Xanthopoulos, P., Guarracino, M.R., Pardalos, P.M.: Robust generalized eigenvalue classifier with ellipsoidal uncertainty. Ann. Oper. Res. 216(1), 327\u2013342 (2014)","journal-title":"Ann. Oper. Res."},{"key":"1051_CR22","volume-title":"Robust Data Mining","author":"P Xanthopoulos","year":"2012","unstructured":"Xanthopoulos, P., Pardalos, P., Trafalis, T.B.: Robust Data Mining. Springer, Berlin (2012)"},{"issue":"2","key":"1051_CR23","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1109\/TNET.2009.2026275","volume":"18","author":"Y Xi","year":"2010","unstructured":"Xi, Y., Yeh, E.M.: Distributed algorithms for minimum cost multicast with network coding. IEEE\/ACM Trans. Netw. 18(2), 379\u2013392 (2010)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"1051_CR24","volume-title":"Linear Programming and Network Flows","author":"MS Bazaraa","year":"2011","unstructured":"Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: Linear Programming and Network Flows. Wiley-Interscience, New York (2011)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1051-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1051-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1051-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1051-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T19:55:29Z","timestamp":1568058929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1051-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,20]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["1051"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1051-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2016,6,20]]}}}