{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:48:34Z","timestamp":1769316514857,"version":"3.49.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T00:00:00Z","timestamp":1618185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T00:00:00Z","timestamp":1618185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10479-021-03993-6","type":"journal-article","created":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T13:02:53Z","timestamp":1618232573000},"page":"481-527","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Alternate second order conic program reformulations for hub location under stochastic demand and congestion"],"prefix":"10.1007","volume":"304","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9576-4174","authenticated-orcid":false,"given":"Sneha","family":"Dhyani Bhatt","sequence":"first","affiliation":[]},{"given":"Sachin","family":"Jayaswal","sequence":"additional","affiliation":[]},{"given":"Ankur","family":"Sinha","sequence":"additional","affiliation":[]},{"given":"Navneet","family":"Vidyarthi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,12]]},"reference":[{"key":"3993_CR1","unstructured":"Ahmadi-Javid, A., & Hoseinpour, P. (2017). Convexification of queueing formulas by mixed-integer second-order cone programming: An application to a discrete location problem with congestion. arXiv preprint arXiv:1710.05794."},{"key":"3993_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.trc.2018.12.011","volume":"102","author":"F Alkaabneh","year":"2019","unstructured":"Alkaabneh, F., Diabat, A., & Elhedhli, S. (2019). A Lagrangian heuristic and grasp for the hub-and-spoke network system with economies-of-scale and congestion. Transportation Research Part C: Emerging Technologies, 102, 249\u2013273.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"1","key":"3993_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research, 190(1), 1\u201321.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"3993_CR4","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/opre.1110.1037","volume":"60","author":"A Atamt\u00fcrk","year":"2012","unstructured":"Atamt\u00fcrk, A., Berenguer, G., & Shen, Z. J. (2012). A conic integer programming approach to stochastic joint location-inventory problems. Operations Research, 60(2), 366\u2013381.","journal-title":"Operations Research"},{"issue":"3","key":"3993_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/0377-2217(94)90062-0","volume":"79","author":"T Aykin","year":"1994","unstructured":"Aykin, T. (1994). Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. European Journal of Operational Research, 79(3), 501\u2013523.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"3993_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-017-2656-3","volume":"264","author":"N Azizi","year":"2018","unstructured":"Azizi, N., Vidyarthi, N., & Chauhan, S. S. (2018). Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion. Annals of Operations Research, 264(1\u20132), 1\u201340.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3993_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1366-5545(97)00037-9","volume":"34","author":"N Bania","year":"1998","unstructured":"Bania, N., Bauer, P. W., & Zlatoper, T. J. (1998). Us air passenger service: A taxonomy of route networks, hub locations, and competition. Transportation Research Part E: Logistics and Transportation Review, 34(1), 53\u201374.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"3993_CR8","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/S0377-2217(03)00072-9","volume":"155","author":"N Boland","year":"2004","unstructured":"Boland, N., Krishnamoorthy, M., Ernst, A. T., & Ebery, J. (2004). Preprocessing and cutting for multiple allocation hub location problems. European Journal of Operational Research, 155(3), 638\u2013653.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"3993_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1287\/trsc.1120.0410","volume":"46","author":"JF Campbell","year":"2012","unstructured":"Campbell, J. F., & O\u2019Kelly, M. E. (2012). Twenty-five years of hub location research. Transportation Science, 46(2), 153\u2013169.","journal-title":"Transportation Science"},{"issue":"4","key":"3993_CR10","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1287\/trsc.1110.0398","volume":"46","author":"I Contreras","year":"2012","unstructured":"Contreras, I., Cordeau, J. F., & Laporte, G. (2012). Exact solution of large-scale hub location problems with multiple capacity levels. Transportation Science, 46(4), 439\u2013459.","journal-title":"Transportation Science"},{"issue":"3","key":"3993_CR11","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00291-008-0159-y","volume":"31","author":"I Contreras","year":"2009","unstructured":"Contreras, I., D\u00edaz, J. A., & Fern\u00e1ndez, E. (2009). Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum, 31(3), 483\u2013505.","journal-title":"OR Spectrum"},{"issue":"1","key":"3993_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1287\/ijoc.1100.0391","volume":"23","author":"I Contreras","year":"2011","unstructured":"Contreras, I., D\u00edaz, J. A., & Fern\u00e1ndez, E. (2011). Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS Journal on Computing, 23(1), 41\u201355.","journal-title":"INFORMS Journal on Computing"},{"issue":"8\u20139","key":"3993_CR13","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.trb.2009.12.016","volume":"44","author":"I Correia","year":"2010","unstructured":"Correia, I., Nickel, S., & Saldanha-da Gama, F. (2010). Single-assignment hub location problems with multiple capacity levels. Transportation Research Part B: Methodological, 44(8\u20139), 1047\u20131066.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"10","key":"3993_CR14","doi-asserted-by":"publisher","first-page":"4841","DOI":"10.1016\/j.apm.2011.03.046","volume":"35","author":"I Correia","year":"2011","unstructured":"Correia, I., Nickel, S., & Saldanha-da Gama, F. (2011). Hub and spoke network design with single-assignment, capacity decisions and balancing requirements. Applied Mathematical Modelling, 35(10), 4841\u20134851.","journal-title":"Applied Mathematical Modelling"},{"issue":"11","key":"3993_CR15","doi-asserted-by":"publisher","first-page":"3671","DOI":"10.1016\/j.cor.2007.04.005","volume":"35","author":"CM da Gra\u00e7a","year":"2008","unstructured":"da Gra\u00e7a, C. M., Captivo, M. E., & Cl\u00edmaco, J. (2008). Capacitated single allocation hub location problema bi-criteria approach. Computers & Operations Research, 35(11), 3671\u20133695.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3993_CR16","first-page":"479","volume":"67","author":"T Dan","year":"2019","unstructured":"Dan, T., & Marcotte, P. (2019). Competitive facility location with selfish users and queues. Operations Research, 67(2), 479\u2013497.","journal-title":"Operations Research"},{"issue":"5","key":"3993_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.orl.2011.06.015","volume":"39","author":"RS de Camargo","year":"2011","unstructured":"de Camargo, R. S., de Miranda, J. G., & Ferreira, R. P. (2011). A hybrid outer-approximation\/benders decomposition algorithm for the single allocation hub location problem under congestion. Operations Research Letters, 39(5), 329\u2013337.","journal-title":"Operations Research Letters"},{"issue":"12","key":"3993_CR18","doi-asserted-by":"publisher","first-page":"3097","DOI":"10.1016\/j.cor.2008.10.004","volume":"36","author":"RS de Camargo","year":"2009","unstructured":"de Camargo, R. S., Miranda, G, Jr., Ferreira, R. P. M., & Luna, H. (2009a). Multiple allocation hub-and-spoke network design under hub congestion. Computers & Operations Research, 36(12), 3097\u20133106.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"3993_CR19","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.cor.2006.07.002","volume":"35","author":"RS de Camargo","year":"2008","unstructured":"de Camargo, R. S., Miranda, G, Jr., & Luna, H. (2008). Benders decomposition for the uncapacitated multiple allocation hub location problem. Computers & Operations Research, 35(4), 1047\u20131064.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"3993_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/trsc.1080.0233","volume":"43","author":"RS de Camargo","year":"2009","unstructured":"de Camargo, R. S., de Miranda, J. G., & Luna, H. P. L. (2009b). Benders decomposition for hub location problems with economies of scale. Transportation Science, 43(1), 86\u201397.","journal-title":"Transportation Science"},{"issue":"2","key":"3993_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E. D., & Mor\u00e9, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2), 201\u2013213.","journal-title":"Mathematical Programming"},{"issue":"3","key":"3993_CR22","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0377-2217(98)00395-6","volume":"120","author":"J Ebery","year":"2000","unstructured":"Ebery, J., Krishnamoorthy, M., Ernst, A., & Boland, N. (2000). The capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research, 120(3), 614\u2013631.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"3993_CR23","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.cor.2003.11.016","volume":"32","author":"S Elhedhli","year":"2005","unstructured":"Elhedhli, S., & Hu, F. X. (2005). Hub-and-spoke network design with congestion. Computers & Operations Research, 32(6), 1615\u20131632.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3993_CR24","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1287\/ijoc.1090.0335","volume":"22","author":"S Elhedhli","year":"2010","unstructured":"Elhedhli, S., & Wu, H. (2010). A lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion. INFORMS Journal on Computing, 22(2), 282\u2013296.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"3993_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"AT Ernst","year":"1996","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4(3), 139\u2013154.","journal-title":"Location Science"},{"issue":"2","key":"3993_CR26","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/ijoc.10.2.149","volume":"10","author":"AT Ernst","year":"1998","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1998). An exact solution approach based on shortest-paths for p-hub median problems. INFORMS Journal on Computing, 10(2), 149\u2013162.","journal-title":"INFORMS Journal on Computing"},{"key":"3993_CR27","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1018994432663","volume":"86","author":"AT Ernst","year":"1999","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86, 141\u2013159.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"3993_CR28","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani, R. Z., Hekmatfar, M., Arabani, A. B., & Nikbakhsh, E. (2013). Hub location problems: A review of models, classification, solution techniques, and applications. Computers & Industrial Engineering, 64(4), 1096\u20131109.","journal-title":"Computers & Industrial Engineering"},{"key":"3993_CR29","doi-asserted-by":"crossref","unstructured":"G\u00fcnl\u00fck, O., & Linderoth, J. (2012). Perspective reformulation and applications. In Mixed integer nonlinear programming, Springer, pp. 61\u201389.","DOI":"10.1007\/978-1-4614-1927-3_3"},{"issue":"3","key":"3993_CR30","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s00500-016-2398-1","volume":"22","author":"H Hasanzadeh","year":"2018","unstructured":"Hasanzadeh, H., Bashiri, M., & Amiri, A. (2018). A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming. Soft Computing, 22(3), 949\u2013961.","journal-title":"Soft Computing"},{"key":"3993_CR31","unstructured":"Jayaswal, S., & Vidyarthi, N. (2013). Capacitated multiple allocation hub location with service level constraints for multiple consignment classes. Technical report, Indian Institute of Management Ahmedabad, Research and Publication Department."},{"issue":"9","key":"3993_CR32","doi-asserted-by":"publisher","first-page":"2791","DOI":"10.1080\/00207543.2016.1145816","volume":"54","author":"S Jayaswal","year":"2016","unstructured":"Jayaswal, S., & Jewkes, E. M. (2016). Price and lead time differentiation, capacity strategy and market competition. International Journal of Production Research, 54(9), 2791\u20132806.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"3993_CR33","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1016\/j.ejor.2010.11.028","volume":"210","author":"S Jayaswal","year":"2011","unstructured":"Jayaswal, S., Jewkes, E., & Ray, S. (2011). Product differentiation and operations strategy in a capacitated environment. European Journal of Operational Research, 210(3), 716\u2013728.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3993_CR34","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s11590-016-1005-9","volume":"11","author":"S Jayaswal","year":"2017","unstructured":"Jayaswal, S., Vidyarthi, N., & Das, S. (2017). A cutting plane approach to combinatorial bandwidth packing problem with queuing delays. Optimization Letters, 11(1), 225\u2013239.","journal-title":"Optimization Letters"},{"issue":"3","key":"3993_CR35","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/S0377-2217(99)00274-X","volume":"125","author":"BY Kara","year":"2000","unstructured":"Kara, B. Y., & Tansel, B. C. (2000). On the single-assignment p-hub center problem. European Journal of Operational Research, 125(3), 648\u2013655.","journal-title":"European Journal of Operational Research"},{"key":"3993_CR36","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.cie.2016.09.019","volume":"101","author":"R Kian","year":"2016","unstructured":"Kian, R., & Kargar, K. (2016). Comparison of the formulations for a hub-and-spoke network design problem under congestion. Computers & Industrial Engineering, 101, 504\u2013512.","journal-title":"Computers & Industrial Engineering"},{"issue":"1\u20134","key":"3993_CR37","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0966-8349(98)00042-4","volume":"6","author":"JG Klincewicz","year":"1998","unstructured":"Klincewicz, J. G. (1998). Hub location in backbone\/tributary network design: A review. Location Science, 6(1\u20134), 307\u2013335.","journal-title":"Location Science"},{"issue":"3","key":"3993_CR38","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.ejor.2013.06.006","volume":"231","author":"A L\u00fcer-Villagra","year":"2013","unstructured":"L\u00fcer-Villagra, A., & Marianov, V. (2013). A competitive hub location and pricing problem. European Journal of Operational Research, 231(3), 734\u2013744.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"3993_CR39","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/S0305-0548(02)00052-7","volume":"30","author":"V Marianov","year":"2003","unstructured":"Marianov, V., & Serra, D. (2003). Location models for airline hubs behaving as m\/d\/c queues. Computers & Operations Research, 30(7), 983\u20131003.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3993_CR40","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0377-2217(98)00195-7","volume":"114","author":"V Marianov","year":"1999","unstructured":"Marianov, V., Serra, D., & ReVelle, C. (1999). Location of hubs in a competitive environment. European Journal of Operational Research, 114(2), 363\u2013371.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"3993_CR41","doi-asserted-by":"publisher","first-page":"3093","DOI":"10.1016\/j.cor.2004.04.008","volume":"32","author":"A Mar\u00edn","year":"2005","unstructured":"Mar\u00edn, A. (2005). Formulating and solving splittable capacitated multiple allocation hub location problems. Computers & Operations Research, 32(12), 3093\u20133109.","journal-title":"Computers & Operations Research"},{"issue":"10","key":"3993_CR42","first-page":"865","volume":"37","author":"JC Mart\u00edn","year":"2003","unstructured":"Mart\u00edn, J. C., & Rom\u00e1n, C. (2003). Hub location in the south-Atlantic airline market: A spatial competition game. Transportation Research Part A: Policy and Practice, 37(10), 865\u2013888.","journal-title":"Transportation Research Part A: Policy and Practice"},{"issue":"3","key":"3993_CR43","first-page":"209","volume":"25","author":"S McShan","year":"1989","unstructured":"McShan, S., & Windle, R. (1989). The implications of hub-and-spoke routing for airline costs. Logistics and Transportation Review, 25(3), 209.","journal-title":"Logistics and Transportation Review"},{"issue":"5","key":"3993_CR44","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1287\/trsc.2017.0751","volume":"52","author":"JF Meier","year":"2017","unstructured":"Meier, J. F., & Clausen, U. (2017). Solving single allocation hub location problems on Euclidean data. Transportation Science, 52(5), 1141\u20131155.","journal-title":"Transportation Science"},{"issue":"2","key":"3993_CR45","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1287\/trsc.20.2.92","volume":"20","author":"ME O\u2019kelly","year":"1986","unstructured":"O\u2019kelly, M. E. (1986). The location of interacting hub facilities. Transportation Science, 20(2), 92\u2013106.","journal-title":"Transportation Science"},{"issue":"3","key":"3993_CR46","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"ME O\u2019kelly","year":"1987","unstructured":"O\u2019kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32(3), 393\u2013404.","journal-title":"European Journal of Operational Research"},{"key":"3993_CR47","doi-asserted-by":"publisher","first-page":"836","DOI":"10.2307\/135934","volume":"28","author":"TH Oum","year":"1995","unstructured":"Oum, T. H., Zhang, A., & Zhang, Y. (1995). Airline network rivalry. Canadian Journal of Economics, 28, 836\u2013857.","journal-title":"Canadian Journal of Economics"},{"issue":"2","key":"3993_CR48","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.ejor.2006.11.026","volume":"184","author":"I Rodr\u00edguez-Mart\u00edn","year":"2008","unstructured":"Rodr\u00edguez-Mart\u00edn, I., & Salazar-Gonz\u00e1lez, J. J. (2008). Solving a capacitated hub location problem. European Journal of Operational Research, 184(2), 468\u2013479.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3993_CR49","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/0377-2217(95)00100-X","volume":"94","author":"D Skorin-Kapov","year":"1996","unstructured":"Skorin-Kapov, D., Skorin-Kapov, J., & O\u2019Kelly, M. (1996). Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research, 94(3), 582\u2013593.","journal-title":"European Journal of Operational Research"},{"key":"3993_CR50","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ejor.2020.07.018","volume":"290","author":"R Tiwari","year":"2020","unstructured":"Tiwari, R., Jayaswal, S., & Sinha, A. (2020). Alternate solution approaches for competitive hub location problems. European Journal of Operational Research, 290, 68\u201380.","journal-title":"European Journal of Operational Research"},{"key":"3993_CR51","first-page":"16","volume":"24","author":"RS Toh","year":"1985","unstructured":"Toh, R. S., & Higgins, R. G. (1985). The impact of hub and spoke network centralization and route monopoly on domestic airline profitability. Transportation Journal, 24, 16\u201327.","journal-title":"Transportation Journal"},{"key":"3993_CR52","unstructured":"Vidyarthi, N., Jayaswal, S., Chetty, V. B. T., et\u00a0al. (2013). Exact solution to bandwidth packing problem with queuing delays. Indian Institute of Management."},{"key":"3993_CR53","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.cor.2014.02.014","volume":"48","author":"N Vidyarthi","year":"2014","unstructured":"Vidyarthi, N., & Jayaswal, S. (2014). Efficient solution of a class of location-allocation problems with stochastic demand and congestion. Computers & Operations Research, 48, 20\u201330.","journal-title":"Computers & Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-03993-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-03993-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-03993-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,6]],"date-time":"2021-08-06T15:29:30Z","timestamp":1628263770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-03993-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,12]]},"references-count":53,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["3993"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-03993-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,12]]},"assertion":[{"value":"9 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}