{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T21:36:42Z","timestamp":1777498602086,"version":"3.51.4"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,23]],"date-time":"2015-04-23T00:00:00Z","timestamp":1429747200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10898-015-0303-6","type":"journal-article","created":{"date-parts":[[2015,4,22]],"date-time":"2015-04-22T08:37:31Z","timestamp":1429691851000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Reverse propagation of McCormick relaxations"],"prefix":"10.1007","volume":"63","author":[{"given":"Achim","family":"Wechsung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph K.","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harry A. J.","family":"Watson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul I.","family":"Barton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,23]]},"reference":[{"key":"303_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00121749","volume":"9","author":"CS Adjiman","year":"1996","unstructured":"Adjiman, C.S., Floudas, C.A.: Rigorous convex underestimators for general twice-differentiable problems. J. Glob. Optim. 9, 23\u201340 (1996)","journal-title":"J. Glob. Optim."},{"key":"303_CR2","unstructured":"Bart\u00e1k, R.: Theory and practice of constraint propagation. In: Proceedings of the 3rd Workshop on Constraint Programming in Decision and Control, pp. 7\u201314 (2001)"},{"issue":"4\u20135","key":"303_CR3","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4\u20135), 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"303_CR4","doi-asserted-by":"crossref","unstructured":"Belotti, P., Cafieri, S., Lee, J., Liberti, L.: Feasibility-based bounds tightening via fixed points. In: Wu, W., Daescu, O. (eds.) Combinatorial Optimization and Applications, vol. 6508, pp. 65\u201376. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-17458-2_7"},{"issue":"1","key":"303_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(96)00142-2","volume":"32","author":"F Benhamou","year":"1997","unstructured":"Benhamou, F., Older, W.J.: Applying interval arithmetic to real, integer, and boolean constraints. J. Logic Program. 32(1), 1\u201324 (1997)","journal-title":"J. Logic Program."},{"key":"303_CR6","unstructured":"Benhamou, F., McAllester, D., Van Hentenryck, P.: CLP (intervals) revisited. In: Bruynooghe, M. (ed.) Proceedings of the 1994 International Symposium on Logic Programming, pp. 124\u2013138. MIT Press, Cambridge (1994)"},{"key":"303_CR7","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.F.: Revising hull and box consistency. In: Proceedings of the International Conference on Logic Programming (ICLP\u201999), pp. 230\u2013244. MIT Press, Cambridge (1999)"},{"key":"303_CR8","doi-asserted-by":"crossref","unstructured":"Benhamou, F., Granvilliers, L., Goualard, F.: Interval constraints: results and perspectives. In: New Trends in Constraints, Lecture Notes in Artificial Intelligence vol. 1865, pp. 1\u201316. Springer, Berlin (2000)","DOI":"10.1007\/3-540-44654-0_1"},{"key":"303_CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S1574-6526(06)80007-6","volume-title":"Handbook of Constraint Programming","author":"C Bessiere","year":"2006","unstructured":"Bessiere, C.: Constraint propagation. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, pp. 29\u201383. Elsevier, Amsterdam (2006). chap 3"},{"key":"303_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-011-9685-2","volume":"52","author":"A Bompadre","year":"2012","unstructured":"Bompadre, A., Mitsos, A.: Convergence rate of McCormick relaxations. J. Glob. Optim. 52, 1\u201328 (2012)","journal-title":"J. Glob. Optim."},{"key":"303_CR11","unstructured":"Chachuat, B.: MC++\u2014A Versatile Library for McCormick Relaxations and Taylor Models. http:\/\/www3.imperial.ac.uk\/people\/b.chachuat\/research\/ (2011)"},{"issue":"2","key":"303_CR12","first-page":"124","volume":"2","author":"JG Cleary","year":"1987","unstructured":"Cleary, J.G.: Logical arithmetic. Future Comput. Syst. 2(2), 124\u2013149 (1987)","journal-title":"Future Comput. Syst."},{"issue":"3","key":"303_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","volume":"32","author":"E Davis","year":"1987","unstructured":"Davis, E.: Constraint propagation with interval labels. Artif. Intell. 32(3), 281\u2013331 (1987)","journal-title":"Artif. Intell."},{"key":"303_CR14","volume-title":"Towards Global Optimization","author":"LCW Dixon","year":"1978","unstructured":"Dixon, L.C.W., Szego, G.P.: The optimization problem: an introduction. In: Dixon, L.C.W., Szego, G.P. (eds.) Towards Global Optimization. North Holland, New York (1978)"},{"issue":"3","key":"303_CR15","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/s10601-009-9076-1","volume":"15","author":"F Domes","year":"2010","unstructured":"Domes, F., Neumaier, A.: Constraint propagation on quadratic constraints. Constraints 15(3), 404\u2013429 (2010)","journal-title":"Constraints"},{"key":"303_CR16","doi-asserted-by":"crossref","unstructured":"Dulmage, A., Mendelsohn, N.: Coverings of bipartite graphs. Can. J. Math. 517\u2013534 (1958)","DOI":"10.4153\/CJM-1958-052-0"},{"key":"303_CR17","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"JE Falk","year":"1969","unstructured":"Falk, J.E., Soland, R.M.: An algorithm for separable nonconvex programming problems. Manag. Sci. 15, 550\u2013569 (1969)","journal-title":"Manag. Sci."},{"issue":"1","key":"303_CR18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"PE Gill","year":"2002","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2002)","journal-title":"SIAM Rev."},{"issue":"1","key":"303_CR19","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1145\/1132973.1132980","volume":"32","author":"L Granvilliers","year":"2006","unstructured":"Granvilliers, L., Benhamou, F.: Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques. ACM Trans. Math. Softw. 32(1), 138\u2013156 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"303_CR20","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717761","volume-title":"Evaluating Derivatives","author":"A Griewank","year":"2008","unstructured":"Griewank, A., Walther, A.: Evaluating Derivatives, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2008)","edition":"2"},{"key":"303_CR21","volume-title":"Global Optimization Using Interval Analysis","author":"E Hansen","year":"2004","unstructured":"Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis, 2nd edn. Marcel Dekker, New York (2004)","edition":"2"},{"issue":"1\u20133","key":"303_CR22","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01582889","volume":"52","author":"P Hansen","year":"1991","unstructured":"Hansen, P., Jaumard, B., Lu, S.H.: An analytical approach to global optimization. Math. Program. 52(1\u20133), 227\u2013254 (1991)","journal-title":"Math. Program."},{"key":"303_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Springer, Berlin (1993)"},{"key":"303_CR24","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033036","volume-title":"Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"J Hooker","year":"2000","unstructured":"Hooker, J.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York (2000)"},{"key":"303_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)","edition":"3"},{"issue":"1\u20133","key":"303_CR26","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(92)90005-I","volume":"58","author":"E Hyv\u00f6nen","year":"1992","unstructured":"Hyv\u00f6nen, E.: Constraint reasoning based on interval arithmetic: the tolerance propagation approach. Artif. Intell. 58(1\u20133), 71\u2013112 (1992)","journal-title":"Artif. Intell."},{"issue":"2\u20134","key":"303_CR27","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00607-011-0169-5","volume":"94","author":"L Jaulin","year":"2012","unstructured":"Jaulin, L.: Solving set-valued constraint satisfaction problems. Computing 94(2\u20134), 297\u2013311 (2012)","journal-title":"Computing"},{"key":"303_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0249-6","volume-title":"Applied Interval Analysis","author":"L Jaulin","year":"2001","unstructured":"Jaulin, L., Michel, K., Didrit, O., Walter, E.: Applied Interval Analysis. Springer, London (2001)"},{"key":"303_CR29","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1008739111712","volume":"15","author":"F Kappel","year":"2000","unstructured":"Kappel, F., Kuntsevich, A.: An implementation of Shor\u2019s r-algorithm. Comput. Optim. Appl. 15, 193\u2013205 (2000)","journal-title":"Comput. Optim. Appl."},{"key":"303_CR30","unstructured":"Kearfott, R.B., Nakao, M., Neumaier, A., Rump, S.M., Shary, S., Van Hentenryck, P.: Standardized notation in interval analysis. In: Proceedings of the XIII Baikal International School-seminar \u201cOptimization methods and their applications\u201d, vol. 4, pp. 106\u2013113. Institute of Energy Systems SB RAS, Irkutsk, Russia (2005)"},{"key":"303_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0074500","volume-title":"Methods of Descent for Nondifferentiable Optimization","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization. Springer, Berlin (1985)"},{"issue":"5","key":"303_CR32","doi-asserted-by":"crossref","first-page":"2076","DOI":"10.1137\/S0036142903436174","volume":"42","author":"Y Lebbah","year":"2005","unstructured":"Lebbah, Y., Michel, C., Rueher, M., Daney, D., Merlet, J.P.: Efficient and safe global constraints for handling numerical constraint systems. SIAM J. Numer. Anal. 42(5), 2076 (2005)","journal-title":"SIAM J. Numer. Anal."},{"key":"303_CR33","unstructured":"Lhomme, O.: Consistency techniques for numeric CSPs. In: International Joint Conference on Artificial Intelligence, pp. 232\u2013238 (1993)"},{"key":"303_CR34","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/383738.383740","volume":"27","author":"L Luk\u0161an","year":"2001","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Algorithm 811: NDA: algorithms for nondifferentiable optimization. ACM Trans. Math. Softw. 27, 193\u2013213 (2001)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"303_CR35","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8(1), 99\u2013118 (1977)","journal-title":"Artif. Intell."},{"key":"303_CR36","unstructured":"M\u00e4kel\u00e4, M.M.: Multiobjective Proximal Bundle Method for Nonconvex Nonsmooth Optimization: Fortran Subroutine MPBNGC 2.0. Reports of the Department of Mathematical Information Technology, Series B, Scientific computing (B 13\/2003), University of Jyv\u00e4skyl\u00e4, Jyv\u00e4skyl\u00e4 (2003)"},{"key":"303_CR37","doi-asserted-by":"crossref","DOI":"10.1142\/1493","volume-title":"Nonsmooth Optimization","author":"MM M\u00e4kel\u00e4","year":"1992","unstructured":"M\u00e4kel\u00e4, M.M., Neittaanm\u00e4ki, P.: Nonsmooth Optimization. World Scientific, Singapore (1992)"},{"key":"303_CR38","unstructured":"MATLAB.: Version 8.3.0 (R2014a). The MathWorks Inc., Natick, MA (2014)"},{"key":"303_CR39","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I\u2014convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"303_CR40","unstructured":"Melquiond, G., Pion, S., Br\u00f6nnimann, H.: Boost Interval Arithmetic Library. http:\/\/www.boost.org\/doc\/libs\/1_49_0\/ (2006)"},{"key":"303_CR41","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1137\/080717341","volume":"20","author":"A Mitsos","year":"2009","unstructured":"Mitsos, A., Chachuat, B., Barton, P.I.: McCormick-based relaxations of algorithms. SIAM J. Optim. 20, 573\u2013601 (2009)","journal-title":"SIAM J. Optim."},{"key":"303_CR42","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970906","volume-title":"Methods and Applications of Interval Analysis","author":"RE Moore","year":"1979","unstructured":"Moore, R.E.: Methods and Applications of Interval Analysis. SIAM, Philadelphia (1979)"},{"key":"303_CR43","volume-title":"Interval Methods for Systems of Equations","author":"A Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"key":"303_CR44","first-page":"271","volume-title":"Acta Numerica","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A.: Complete search in continuous global optimization and constraint satisfaction. In: Iserles, A. (ed.) Acta Numerica, vol. 13, pp. 271\u2013370. Cambridge University Press, Cambridge (2004)"},{"key":"303_CR45","volume-title":"Computer Methods for the Range of Functions","author":"H Ratschek","year":"1984","unstructured":"Ratschek, H., Rokne, J.: Computer Methods for the Range of Functions. Ellis Horwood, Chichester (1984)"},{"key":"303_CR46","volume-title":"Principles of Mathematical Analysis","author":"W Rudin","year":"1976","unstructured":"Rudin, W.: Principles of Mathematical Analysis, 3rd edn. McGraw-Hill, New York (1976)","edition":"3"},{"issue":"5","key":"303_CR47","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"HS Ryoo","year":"1995","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"303_CR48","unstructured":"Sahinidis, N.V., Tawarmalani, M.: BARON Solver Manual. http:\/\/gams.com\/dd\/docs\/solvers\/baron.pdf (2009)"},{"issue":"1\u20132","key":"303_CR49","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF00143879","volume":"1","author":"D Sam-Haroud","year":"1996","unstructured":"Sam-Haroud, D., Faltings, B.: Consistency techniques for continuous constraints. Constraints 1(1\u20132), 85\u2013118 (1996)","journal-title":"Constraints"},{"issue":"4","key":"303_CR50","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10898-005-0937-x","volume":"33","author":"H Schichl","year":"2005","unstructured":"Schichl, H., Neumaier, A.: Interval analysis on directed acyclic graphs for global optimization. J. Glob. Optim. 33(4), 541\u2013562 (2005)","journal-title":"J. Glob. Optim."},{"key":"303_CR51","unstructured":"Scott, J.K.: Reachability Analysis and Deterministic Global Optimization of Differential-algebraic Systems. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA (2012)"},{"issue":"4","key":"303_CR52","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s10898-011-9664-7","volume":"51","author":"JK Scott","year":"2011","unstructured":"Scott, J.K., Stuber, M.D., Barton, P.I.: Generalized McCormick relaxations. J. Glob. Optim. 51(4), 569\u2013606 (2011)","journal-title":"J. Glob. Optim."},{"key":"303_CR53","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/978-3-540-39901-8_16","volume-title":"Global Optimization and Constraint Satisfaction","author":"O Shcherbina","year":"2003","unstructured":"Shcherbina, O., Neumaier, A., Sam-Haroud, D., Vu, X.H., Nguyen, T.V.: Benchmarking global optimization and constraint satisfaction codes. In: Bliek, C., Jermann, C., Neumaier, A. (eds.) Global Optimization and Constraint Satisfaction, pp. 211\u2013222. Springer, Berlin (2003)"},{"key":"303_CR54","doi-asserted-by":"crossref","first-page":"S791","DOI":"10.1016\/S0098-1354(97)87599-0","volume":"21","author":"EMB Smith","year":"1997","unstructured":"Smith, E.M.B., Pantelides, C.C.: Global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 21, S791\u2013S796 (1997)","journal-title":"Comput. Chem. Eng."},{"key":"303_CR55","doi-asserted-by":"crossref","unstructured":"Stuber, M.D., Scott, J.K.: Convex and concave relaxations of implicit functions. Optim. Methods Softw. (in press) (2014)","DOI":"10.1080\/10556788.2014.924514"},{"key":"303_CR56","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming. Kluwer, Dordrecht (2002)"},{"key":"303_CR57","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"303_CR58","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"303_CR59","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1137\/S0036142995281504","volume":"34","author":"P Hentenryck Van","year":"1997","unstructured":"Van Hentenryck, P., McAllester, D., Kapur, D.: Solving polynomial systems using a branch and prune approach. SIAM J. Numer. Anal. 34(2), 797\u2013827 (1997)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1\u20132","key":"303_CR60","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0167-6423(97)00008-7","volume":"30","author":"P Hentenryck Van","year":"1998","unstructured":"Van Hentenryck, P., Michel, L., Benhamou, F.: Constraint programming over nonlinear constraints. Sci. Comput. Program. 30(1\u20132), 83\u2013118 (1998)","journal-title":"Sci. Comput. Program."},{"key":"303_CR61","doi-asserted-by":"crossref","unstructured":"Vu, X.H., Sam-Haroud, D., Silaghi, M.C.: Numerical constraint satisfaction problems with non-isolated solutions. In: Bliek, C., Jermann, C., Neumaier, A. (eds.) Global Optimization and Constraint Satisfaction, Lecture Notes in Computer Science, vol. 2861, pp. 194\u2013210. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-39901-8_15"},{"issue":"4","key":"303_CR62","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s10898-008-9386-7","volume":"45","author":"XH Vu","year":"2009","unstructured":"Vu, X.H., Schichl, H., Sam-Haroud, D.: Interval propagation and search on directed acyclic graphs for numerical constraint solving. J. Glob. Optim. 45(4), 499\u2013531 (2009)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0303-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0303-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0303-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T22:56:33Z","timestamp":1566600993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0303-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,23]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["303"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0303-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,23]]}}}