{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:36Z","timestamp":1740109296406,"version":"3.37.3"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100008287","name":"Science and Technology Directorate","doi-asserted-by":"publisher","award":["2017-ST-061-QA0001"],"award-info":[{"award-number":["2017-ST-061-QA0001"]}],"id":[{"id":"10.13039\/100008287","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10107-021-01670-x","type":"journal-article","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T14:27:09Z","timestamp":1624976829000},"page":"1113-1162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal crashing of an activity network with disruptions"],"prefix":"10.1007","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5291-9834","authenticated-orcid":false,"given":"Haoxiang","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6001-9078","authenticated-orcid":false,"given":"David P.","family":"Morton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,29]]},"reference":[{"issue":"11","key":"1670_CR1","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s00170-009-2051-6","volume":"45","author":"A Aghaie","year":"2009","unstructured":"Aghaie, A., Mokhtari, H.: Ant colony optimization algorithm for stochastic project crashing problem in PERT networks using MC simulation. Int. J. Adv. Manuf. Technol. 45(11), 1051\u20131067 (2009)","journal-title":"Int. J. Adv. Manuf. Technol."},{"unstructured":"Ahipasaoglu, S.D., Natarajan, K., Shi, D.: Distributionally robust project crashing with partial or no correlation information. Optimization-Online (2016). http:\/\/www.optimization-online.org\/DB_FILE\/2016\/11\/5715.pdf","key":"1670_CR2"},{"unstructured":"Belotti, P., Cafieri, S., Lee, J., Liberti, L.: On feasibility based bounds tightening. Optimization-Online (2012). http:\/\/www.optimization-online.org\/DB_FILE\/2012\/01\/3325.pdf","key":"1670_CR3"},{"key":"1670_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0377-2217(88)90159-2","volume":"34","author":"JR Birge","year":"1988","unstructured":"Birge, J.R., Louveaux, F.V.: A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34, 384\u2013392 (1988)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1670_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstra, J.K., Kan, A.H.G.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1), 11\u201324 (1983)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"1670_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BF02136842","volume":"53","author":"RA Bowman","year":"1994","unstructured":"Bowman, R.A.: Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation. Ann. Oper. Res. 53(1), 533\u2013551 (1994)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"1670_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1287\/mnsc.18.3.207","volume":"18","author":"JM Burt","year":"1971","unstructured":"Burt, J.M., Garman, M.B.: Conditional Monte Carlo: a simulation technique for stochastic network analysis. Manag. Sci. 18(3), 207\u2013217 (1971)","journal-title":"Manag. Sci."},{"issue":"5","key":"1670_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/inte.20.5.61","volume":"20","author":"JD Camm","year":"1990","unstructured":"Camm, J.D., Raturi, A.S., Tsubakitani, S.: Cutting big M down to size. Interfaces 20(5), 61\u201366 (1990)","journal-title":"Interfaces"},{"issue":"3","key":"1670_CR9","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.ejor.2009.04.011","volume":"201","author":"B Cardoen","year":"2010","unstructured":"Cardoen, B., Demeulemeester, E., Beli\u00ebn, J.: Operating room planning and scheduling: a literature review. Eur. J. Oper. Res. 201(3), 921\u2013932 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"1670_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BF02680570","volume":"83","author":"C Car\u00f8e","year":"1998","unstructured":"Car\u00f8e, C., Tind, J.: L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Program. 83(1\u20133), 451\u2013464 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"1670_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.orl.2011.10.009","volume":"40","author":"B Chen","year":"2012","unstructured":"Chen, B., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: A computational study of the cutting plane tree algorithm for general mixed-integer linear programs. Oper. Res. Lett. 40(1), 15\u201319 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1670_CR12","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/opre.1070.0457","volume":"56","author":"X Chen","year":"2008","unstructured":"Chen, X., Sim, M., Sun, P., Zhang, J.: A linear decision-based approximation approach to stochastic programming. Oper. Res. 56(2), 344\u2013357 (2008)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Coffrin, C., Hijazi, H.L., Van\u00a0Hentenryck, P.: Strengthening convex relaxations with bound tightening for power network optimization. In: International Conference on Principles and Practice of Constraint Programming, pp. 39\u201357. Springer, Berlin (2015)","key":"1670_CR13","DOI":"10.1007\/978-3-319-23219-5_4"},{"issue":"2","key":"1670_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/net.20153","volume":"49","author":"I Cohen","year":"2007","unstructured":"Cohen, I., Golany, B., Shtub, A.: The stochastic time-cost tradeoff problem: a robust optimization approach. Networks 49(2), 175\u2013188 (2007)","journal-title":"Networks"},{"key":"1670_CR15","volume-title":"Lognormal Distributions: Theory and Applications","author":"EL Crow","year":"1987","unstructured":"Crow, E.L., Shimizu, K.: Lognormal Distributions: Theory and Applications. CRC Press, Amsterdam (1987)"},{"issue":"2","key":"1670_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/opre.45.2.302","volume":"45","author":"P De","year":"1997","unstructured":"De, P., Dunne, E.J., Ghosh, J.B., Wells, C.E.: Complexity of the discrete time-cost tradeoff problem for project networks. Oper. Res. 45(2), 302\u2013306 (1997)","journal-title":"Oper. Res."},{"unstructured":"Demeulemeester, E., Herroelen, W.S.: Project Scheduling: A Research Handbook, vol.\u00a049. Springer, Berlin (2006)","key":"1670_CR17"},{"issue":"1","key":"1670_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1022283403119","volume":"6","author":"E Demeulemeester","year":"2003","unstructured":"Demeulemeester, E., Vanhoucke, M., Herroelen, W.: RanGen: a random network generator for activity-on-the-node networks. J. Sched. 6(1), 17\u201338 (2003)","journal-title":"J. Sched."},{"issue":"2","key":"1670_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"key":"1670_CR20","volume-title":"Activity Networks: Project Planning and Control by Network Models","author":"SE Elmaghraby","year":"1977","unstructured":"Elmaghraby, S.E.: Activity Networks: Project Planning and Control by Network Models. Wiley, London (1977)"},{"issue":"2","key":"1670_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1287\/mnsc.7.2.167","volume":"7","author":"DR Fulkerson","year":"1961","unstructured":"Fulkerson, D.R.: A network flow computation for project cost curves. Manag. Sci. 7(2), 167\u2013178 (1961)","journal-title":"Manag. Sci."},{"issue":"1\u20132","key":"1670_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-012-0615-y","volume":"144","author":"D Gade","year":"2014","unstructured":"Gade, D., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs. Math. Program. 144(1\u20132), 39\u201364 (2014)","journal-title":"Math. Program."},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. (1979)","key":"1670_CR23"},{"unstructured":"Gurobi Optimization, Inc.: Gurobi Optimizer Reference Manual (2016). http:\/\/www.gurobi.com","key":"1670_CR24"},{"issue":"3","key":"1670_CR25","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44(3), 510\u2013525 (1996)","journal-title":"Oper. Res."},{"issue":"2","key":"1670_CR26","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S Hartmann","year":"2000","unstructured":"Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 127(2), 394\u2013407 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"3\u20134","key":"1670_CR27","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10287-018-0330-0","volume":"15","author":"L Hellemo","year":"2018","unstructured":"Hellemo, L., Barton, P.I., Tomasgard, A.: Decision-dependent probabilities in stochastic programs with recourse. CMS 15(3\u20134), 369\u2013395 (2018)","journal-title":"CMS"},{"issue":"2","key":"1670_CR28","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1061\/(ASCE)0733-9364(1991)117:2(321)","volume":"117","author":"EJ Jaselskis","year":"1991","unstructured":"Jaselskis, E.J., Ashley, D.B.: Optimal allocation of project management resources for achieving success. J. Constr. Eng. Manag. 117(2), 321\u2013340 (1991)","journal-title":"J. Constr. Eng. Manag."},{"issue":"1","key":"1670_CR29","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1186\/2195-5468-2-8","volume":"2","author":"H Ke","year":"2014","unstructured":"Ke, H.: A genetic algorithm-based optimizing approach for project time-cost trade-off with uncertain measure. J. Uncertain. Anal. Appl. 2(1), 8 (2014)","journal-title":"J. Uncertain. Anal. Appl."},{"issue":"3","key":"1670_CR30","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1287\/opre.9.3.296","volume":"9","author":"JE Kelly","year":"1961","unstructured":"Kelly, J.E.: Critical-path planning and scheduling: mathematical basis. Oper. Res. 9(3), 296\u2013320 (1961)","journal-title":"Oper. Res."},{"issue":"4","key":"1670_CR31","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11081-007-9011-5","volume":"8","author":"S Kim","year":"2007","unstructured":"Kim, S., Boyd, S.P., Yun, S., Patil, D.D., Horowitz, M.A.: A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing. Optim. Eng. 8(4), 397\u2013430 (2007)","journal-title":"Optim. Eng."},{"doi-asserted-by":"crossref","unstructured":"Kim, S., Pasupathy, R., Henderson, S.G.: A guide to sample average approximation. In: Handbook of Simulation Optimization, pp. 207\u2013243. Springer (2015)","key":"1670_CR32","DOI":"10.1007\/978-1-4939-1384-8_8"},{"issue":"1\u20132","key":"1670_CR33","first-page":"18","volume":"18","author":"E Klotz","year":"2013","unstructured":"Klotz, E., Newman, A.M.: Practical guidelines for solving difficult mixed integer linear programs. Surv. Oper. Res. Manag. Sci. 18(1\u20132), 18\u201332 (2013)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"doi-asserted-by":"crossref","unstructured":"Kuhl, M.E., Tolentino-Pe\u00f1a, R.A.: A dynamic crashing method for project management using simulation-based optimization. In: Proceedings of the 40th Conference on Winter Simulation, pp. 2370\u20132376. Winter Simulation Conference (2008)","key":"1670_CR34","DOI":"10.1109\/WSC.2008.4736344"},{"issue":"4","key":"1670_CR35","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10951-015-0423-3","volume":"19","author":"P Lamas","year":"2016","unstructured":"Lamas, P., Demeulemeester, E.: A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations. J. Sched. 19(4), 409\u2013428 (2016)","journal-title":"J. Sched."},{"issue":"4\u20135","key":"1670_CR36","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.compchemeng.2007.03.001","volume":"32","author":"Z Li","year":"2008","unstructured":"Li, Z., Ierapetritou, M.: Process scheduling under uncertainty: review and challenges. Comput. Chem. Eng. 32(4\u20135), 715\u2013727 (2008)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"1670_CR37","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"TL Magnanti","year":"1981","unstructured":"Magnanti, T.L., Wong, R.T.: Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Oper. Res. 29(3), 464\u2013484 (1981)","journal-title":"Oper. Res."},{"issue":"1","key":"1670_CR38","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","volume":"24","author":"WK Mak","year":"1999","unstructured":"Mak, W.K., Morton, D.P., Wood, R.K.: Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24(1), 47\u201356 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"1670_CR39","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1287\/opre.7.5.646","volume":"7","author":"DG Malcolm","year":"1959","unstructured":"Malcolm, D.G., Roseboom, J.H., Clark, C.E., Fazar, W.: Application of a technique for research and development program evaluation. Oper. Res. 7(5), 646\u2013669 (1959)","journal-title":"Oper. Res."},{"issue":"3","key":"1670_CR40","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s001860000095","volume":"52","author":"RH M\u00f6hring","year":"2000","unstructured":"M\u00f6hring, R.H., Stork, F.: Linear preselective policies for stochastic project scheduling. Math. Methods Oper. Res. 52(3), 501\u2013515 (2000)","journal-title":"Math. Methods Oper. Res."},{"unstructured":"Mullen, R.E.: The lognormal distribution of software failure rates: origin and evidence. In: Proceedings Ninth International Symposium on Software Reliability Engineering (Cat. No. 98TB100257), pp. 124\u2013133 (1998)","key":"1670_CR41"},{"doi-asserted-by":"crossref","unstructured":"Naderi, B., Zandieh, M., Fatemi\u00a0Ghomi, S.M.T.: Scheduling job shop problems with sequence-dependent setup times. Int. J. Prod. Res. 47(21), 5959\u20135976 (2009)","key":"1670_CR42","DOI":"10.1080\/00207540802165817"},{"unstructured":"Oberlender, G.D.: Project Management for Engineering and Construction, vol.\u00a02. McGraw-Hill, New York (1993)","key":"1670_CR43"},{"issue":"1","key":"1670_CR44","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-019-01368-1","volume":"181","author":"AB Philpott","year":"2020","unstructured":"Philpott, A.B., Wahid, F., Bonnans, J.F.: MIDAS: a mixed integer dynamic approximation scheme. Math. Program. 181(1), 19\u201350 (2020)","journal-title":"Math. Program."},{"issue":"2","key":"1670_CR45","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF02592150","volume":"75","author":"EL Plambeck","year":"1996","unstructured":"Plambeck, E.L., Fu, B., Robinson, S.M., Suri, R.: Sample-path optimization of convex stochastic performance functions. Math. Program. 75(2), 137\u2013176 (1996)","journal-title":"Math. Program."},{"unstructured":"Project Management Institute: A guide to the project management body of knowledge: PMBOK guide. Project Management Institute, Newtown Square, Pennsylvania (2017)","key":"1670_CR46"},{"issue":"1\u20132","key":"1670_CR47","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10107-016-1006-6","volume":"161","author":"Y Qi","year":"2017","unstructured":"Qi, Y., Sen, S.: The ancestral Benders\u2019 cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming. Math. Program. 161(1\u20132), 193\u2013235 (2017)","journal-title":"Math. Program."},{"key":"1670_CR48","volume-title":"Stochastic Processes","author":"SM Ross","year":"1996","unstructured":"Ross, S.M.: Stochastic Processes, vol. 2. Wiley, New York (1996)"},{"issue":"2","key":"1670_CR49","doi-asserted-by":"publisher","first-page":"19","DOI":"10.5711\/morj.14.2.19","volume":"14","author":"J Salmer\u00f3n","year":"2009","unstructured":"Salmer\u00f3n, J., Wood, R.K., Morton, D.P.: A stochastic program for optimizing military sealift subject to attack. Military Oper. Res. 14(2), 19\u201339 (2009)","journal-title":"Military Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM (2009)","key":"1670_CR50","DOI":"10.1137\/1.9780898718751"},{"issue":"3","key":"1670_CR51","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0263-7863(03)00070-X","volume":"22","author":"J S\u00f6derlund","year":"2004","unstructured":"S\u00f6derlund, J.: Building theories of project management: past research, questions for the future. Int. J. Project Manag. 22(3), 183\u2013191 (2004)","journal-title":"Int. J. Project Manag."},{"doi-asserted-by":"crossref","unstructured":"Srinivasan, S., Brooks, J.P., Wilson, J.H.: Batching-based approaches for optimized packing of jobs in the spatial scheduling problem, pp. 243\u2013263. Springer, Cham (2015)","key":"1670_CR52","DOI":"10.1007\/978-3-319-18899-7_12"},{"unstructured":"Sundar, K., Nagarajan, H., Misra, S., Lu, M., Coffrin, C., Bent, R.: Optimization-based bound tightening using a strengthened QC-relaxation of the optimal power flow problem. arXiv preprint arXiv:1809.04565 (2018)","key":"1670_CR53"},{"doi-asserted-by":"crossref","unstructured":"Tonchia, S.: Industrial Project Management. Springer, Berlin (2018)","key":"1670_CR54","DOI":"10.1007\/978-3-662-56328-1"},{"doi-asserted-by":"crossref","unstructured":"van Slyke, R.M.: Letter to the editor: Monte Carlo methods and the PERT problem. Oper. Res. 11(5), 839\u2013860 (1963)","key":"1670_CR55","DOI":"10.1287\/opre.11.5.839"},{"issue":"1","key":"1670_CR56","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10107-011-0478-7","volume":"135","author":"W Wiesemann","year":"2012","unstructured":"Wiesemann, W., Kuhn, D., Rustem, B.: Robust resource allocations in temporal networks. Math. Program. 135(1), 437\u2013471 (2012)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Yang, H., Nagarajan, H.: Optimal power flow in distribution networks under stochastic N-1 disruptions. Electr. Power Syst. Res. 189, 106689 (2020)","key":"1670_CR57","DOI":"10.1016\/j.epsr.2020.106689"},{"doi-asserted-by":"crossref","unstructured":"Yu, G., Qi, X.: Disruption Management: Framework, Models and Applications. World Scientific (2004)","key":"1670_CR58","DOI":"10.1142\/5632"},{"issue":"6","key":"1670_CR59","doi-asserted-by":"publisher","first-page":"2817","DOI":"10.1109\/TSG.2015.2513048","volume":"7","author":"W Yuan","year":"2016","unstructured":"Yuan, W., Wang, J., Qiu, F., Chen, C., Kang, C., Zeng, B.: Robust optimization-based resilient distribution network planning against natural disasters. IEEE Trans. Smart Grid 7(6), 2817\u20132826 (2016)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"1\u20132","key":"1670_CR60","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10107-018-1249-5","volume":"175","author":"J Zou","year":"2019","unstructured":"Zou, J., Ahmed, S., Sun, X.A.: Stochastic dual dynamic integer programming. Math. Program. 175(1\u20132), 461\u2013502 (2019)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01670-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01670-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01670-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T16:10:06Z","timestamp":1675527006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01670-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":60,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1670"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01670-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2021,6,29]]},"assertion":[{"value":"3 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}