{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:23:55Z","timestamp":1725866635835},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319473635"},{"type":"electronic","value":"9783319473642"}],"license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-47364-2_53","type":"book-chapter","created":{"date-parts":[[2016,9,30]],"date-time":"2016-09-30T12:41:56Z","timestamp":1475239316000},"page":"547-554","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards a Secure Two-Stage Supply Chain Network: A Transportation-Cost Approach"],"prefix":"10.1007","author":[{"given":"Camelia-M.","family":"Pintea","sequence":"first","affiliation":[]},{"given":"Anisoara","family":"Calinescu","sequence":"additional","affiliation":[]},{"given":"Petrica C.","family":"Pop","sequence":"additional","affiliation":[]},{"given":"Cosmin","family":"Sabo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,1]]},"reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S0305-0483(98)00064-4","volume":"27","author":"V Adlakha","year":"1999","unstructured":"Adlakha, V., Kowalski, K.: On the fixed-charge transportation problem. OMEGA Int. J. Manag. Sci. 27, 381\u2013388 (1999)","journal-title":"OMEGA Int. J. Manag. Sci."},{"issue":"6","key":"53_CR2","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., et al.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"issue":"7","key":"53_CR3","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1057\/palgrave.jors.2600554","volume":"49","author":"A Calinescu","year":"1998","unstructured":"Calinescu, A., et al.: Applying and assessing two methods for measuring complexity in manufacturing. J. Oper. Res. Soc. 49(7), 723\u2013733 (1998)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"53_CR4","first-page":"337","volume":"29","author":"C Chira","year":"2010","unstructured":"Chira, C., Dumitrescu, D., Pintea, C.-M.: Learning sensitive stigmergic agents for solving complex problems. Comput. Inf. 29(3), 337\u2013356 (2010)","journal-title":"Comput. Inf."},{"key":"53_CR5","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1057\/jors.1991.189","volume":"42","author":"M Diaby","year":"1991","unstructured":"Diaby, M.: Successive linear approximation procedure for generalized fixed charge transportation problems. J. Oper. Res. Soc. 42, 991\u20131001 (1991)","journal-title":"J. Oper. Res. Soc."},{"key":"53_CR6","unstructured":"Deaconu, A., Ciurea, E.: A study on the feasibility of the inverse supply and demand problem. In: Proceedings 15th International Conference on Computers, pp. 485\u2013490 (2011)"},{"issue":"1","key":"53_CR7","first-page":"13","volume":"50","author":"A Fanea","year":"2006","unstructured":"Fanea, A., Motogna, S., Diosan, L.: Automata-based component composition analysis. Studia Universitas Babes-Bolyai, Informatica 50(1), 13\u201320 (2006)","journal-title":"Studia Universitas Babes-Bolyai, Informatica"},{"issue":"3","key":"53_CR8","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1093\/jigpal\/jzr004","volume":"20","author":"C-M Pintea","year":"2012","unstructured":"Pintea, C.-M., Crisan, G.-C., Chira, C.: Hybrid ant models with a transition policy for solving a complex problem. Logic J. IGPL 20(3), 560\u2013569 (2012)","journal-title":"Logic J. IGPL"},{"key":"53_CR9","doi-asserted-by":"publisher","first-page":"10462","DOI":"10.1016\/j.eswa.2011.02.093","volume":"38","author":"S Molla-Alizadeh-Zavardehi","year":"2011","unstructured":"Molla-Alizadeh-Zavardehi, S., et al.: Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prufer number representation. Expert Sys. Appl. 38, 10462\u201310474 (2011)","journal-title":"Expert Sys. Appl."},{"key":"53_CR10","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.ins.2011.12.032","volume":"192","author":"H Liu","year":"2012","unstructured":"Liu, H., Abraham, A., Sn\u00e1\u0161el, V., McLoone, S.: Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments. Inf. Sci. 192, 228\u2013243 (2012)","journal-title":"Inf. Sci."},{"issue":"3","key":"53_CR11","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1093\/jigpal\/jzv014","volume":"23","author":"C-M Pintea","year":"2015","unstructured":"Pintea, C.-M., Pop, P.C.: An improved hybrid algorithm for capacitated fixed-charge transportation problem. Logic J. IGPL 23(3), 369\u2013378 (2015)","journal-title":"Logic J. IGPL"},{"key":"53_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-28942-2_50","volume-title":"Hybrid Artificial Intelligent Systems","author":"C-M Pintea","year":"2012","unstructured":"Pintea, C.-M., Sitar, C.P., Hajdu-Macelaru, M., Petrica, P.: A hybrid classical approach to a fixed-charged transportation problem. In: Corchado, E., Sn\u00e1\u0161el, V., Abraham, A., Wo\u017aniak, M., Gra\u00f1a, M., Cho, S.-B. (eds.) HAIS 2012. LNCS (LNAI), vol. 7208, pp. 557\u2013566. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-28942-2_50"},{"issue":"2","key":"53_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.jal.2014.11.004","volume":"13","author":"PC Pop","year":"2015","unstructured":"Pop, P.C., et al.: An efficient reverse distribution system for solving sustainable supply chain network design problem. J. Appl. Logic 13(2), 105\u2013113 (2015)","journal-title":"J. Appl. Logic"},{"issue":"2","key":"53_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.37193\/CJM.2016.02.10","volume":"32","author":"PC Pop","year":"2016","unstructured":"Pop, P.C., et al.: A hybrid based genetic algorithm for solving a capacitated fixed-charged transportation problem. Carpathian J. Math. 32(2), 225\u2013232 (2016)","journal-title":"Carpathian J. Math."},{"issue":"5","key":"53_CR15","first-page":"22","volume":"7","author":"JB Rice","year":"2003","unstructured":"Rice, J.B., Caniato, F.: Building a secure and resilient supply network. Supply Chain Manag. Rev. 7(5), 22\u201330 (2003)","journal-title":"Supply Chain Manag. Rev."},{"key":"53_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-00467-9_15","volume":"486","author":"B Iantovics","year":"2014","unstructured":"Iantovics, B., Crainicu, B.: A distributed security approach for intelligent mobile multiagent systems. Stud. Comput. Intell. 486, 175\u2013189 (2014)","journal-title":"Stud. Comput. Intell."},{"issue":"3","key":"53_CR17","first-page":"12","volume":"7","author":"HL Lee","year":"2003","unstructured":"Lee, H.L., Wolfe, M.: Supply chain security without tears. Supply Chain Manag. Rev. 7(3), 12\u201320 (2003)","journal-title":"Supply Chain Manag. Rev."},{"key":"53_CR18","volume-title":"Evolutionary Computation: Principles and Practices","author":"O Matei","year":"2008","unstructured":"Matei, O.: Evolutionary Computation: Principles and Practices. Risoprint, London (2008)"},{"issue":"1","key":"53_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ejor.2006.02.051","volume":"181","author":"M Mes","year":"2007","unstructured":"Mes, M., et al.: Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems. Eur. J. Oper. Res. 181(1), 59\u201375 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"53_CR20","first-page":"48","volume":"5","author":"E Nechita","year":"2008","unstructured":"Nechita, E., et al.: Cooperative ant colonies for vehicle routing problem with time windows. A case study in the distribution of dietary products. WMSCI 5, 48\u201352 (2008)","journal-title":"WMSCI"},{"issue":"1","key":"53_CR21","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.ejor.2004.08.032","volume":"171","author":"S Sivadasan","year":"2006","unstructured":"Sivadasan, S., et al.: Advances on measuring the operational complexity of supplier\u2013customer systems. Eur. J. Oper. Res. 171(1), 208\u2013226 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"53_CR22","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MIC.2005.136","volume":"9","author":"S Song","year":"2005","unstructured":"Song, S., Hwang, K., Zhou, R., Kwok, Y.: Trusted P2P transactions with fuzzy reputation aggregation. IEEE Internet Comput. 9(6), 24\u201334 (2005)","journal-title":"IEEE Internet Comput."},{"key":"53_CR23","first-page":"4","volume":"65","author":"S Song","year":"2005","unstructured":"Song, S., Kwok, Y., Hwang, K.: Security-driven heuristics and a fast genetic algorithm for trusted grid job scheduling. Int. Parallel Distrib. Process. IEEE CS 65, 4\u201312 (2005)","journal-title":"Int. Parallel Distrib. Process. IEEE CS"},{"issue":"6","key":"53_CR24","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1109\/TC.2006.89","volume":"55","author":"S Song","year":"2006","unstructured":"Song, S., Hwang, K., Kwok, Y., et al.: Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling. IEEE Trans. Comp. 55(6), 703 (2006)","journal-title":"IEEE Trans. Comp."},{"issue":"2","key":"53_CR25","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0377-2217(97)00284-1","volume":"106","author":"M Sun","year":"1998","unstructured":"Sun, M., et al.: A tabu search heuristic procedure for the fixed charge transportation problem. Eur. J. Oper. Res. 106(2), 441\u2013456 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"53_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11564621_7","volume-title":"Distributed and Parallel Computing","author":"S Venugopal","year":"2005","unstructured":"Venugopal, S., Buyya, R.: A deadline and budget constrained scheduling algorithm for escience applications on data grids. In: Hobbs, M., Goscinski, A.M., Zhou, W. (eds.) ICA3PP 2005. LNCS, vol. 3719, pp. 60\u201372. Springer, Heidelberg (2005). doi:10.1007\/11564621_7"},{"key":"53_CR27","first-page":"159","volume":"16","author":"A Vescan","year":"2007","unstructured":"Vescan, A., Motogna, S.: Overview and architecture of a component modeling tool. Creative Math. Inf. 16, 159\u2013165 (2007)","journal-title":"Creative Math. Inf."},{"issue":"1","key":"53_CR28","doi-asserted-by":"publisher","first-page":"73","DOI":"10.3233\/HSM-2008-27107","volume":"27","author":"X Li","year":"2008","unstructured":"Li, X., Chandra, C.: Toward a secure supply chain: a system\u2019s perspective. Hum. Syst. Manag. 27(1), 73\u201386 (2008)","journal-title":"Hum. Syst. Manag."}],"container-title":["Advances in Intelligent Systems and Computing","International Joint Conference SOCO\u201916-CISIS\u201916-ICEUTE\u201916"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47364-2_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T02:11:18Z","timestamp":1699841478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-47364-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,1]]},"ISBN":["9783319473635","9783319473642"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47364-2_53","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016,10,1]]},"assertion":[{"value":"1 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICEUTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on EUropean Transnational Education","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Sebasti\u00e1n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iceute2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}