{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:46:07Z","timestamp":1778715967320,"version":"3.51.4"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,2,8]],"date-time":"2017-02-08T00:00:00Z","timestamp":1486512000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61303057"],"award-info":[{"award-number":["61303057"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005231","name":"CAS\/SAFEA International Partnership Program for Creative Research Teams","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005231","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61379048"],"award-info":[{"award-number":["61379048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61672508"],"award-info":[{"award-number":["61672508"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10898-017-0499-8","type":"journal-article","created":{"date-parts":[[2017,2,8]],"date-time":"2017-02-08T03:21:39Z","timestamp":1486524099000},"page":"69-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Solving linear optimization over arithmetic constraint formula"],"prefix":"10.1007","volume":"69","author":[{"given":"Li","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinrun","family":"Lyu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingzheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changyou","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nasro","family":"Min-Allah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamal","family":"Alhiyafi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongji","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,8]]},"reference":[{"issue":"2","key":"499_CR1","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/S0890-5401(03)00020-8","volume":"183","author":"A Armando","year":"2003","unstructured":"Armando, A., Ranise, S., Rusinowitch, M.: A rewriting approach to satisfiability procedures. Inf. Comput. 183(2), 140\u2013164 (2003)","journal-title":"Inf. Comput."},{"issue":"2","key":"499_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10044-010-0191-9","volume":"14","author":"AM Bagirov","year":"2011","unstructured":"Bagirov, A.M., Ugon, J., Webb, D., Karas\u00f6zen, B.: Classification through incremental maxmin separability. Pattern Anal. Appl. 14(2), 165\u2013174 (2011)","journal-title":"Pattern Anal. Appl."},{"key":"499_CR3","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Technical report MSRR #348, Carnegie Mellon University, Pittsburgh, PA (1974)"},{"issue":"3","key":"499_CR4","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods 6(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"499_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1), 3\u201344 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"499_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01587096","volume":"44","author":"E Balas","year":"1989","unstructured":"Balas, E., Tama, J.M., Tind, J.: Sequential convexification in reverse convex and disjunctive programming. Math. Program. 44(1\u20133), 337\u2013350 (1989)","journal-title":"Math. Program."},{"issue":"3","key":"499_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"ML Balinski","year":"1965","unstructured":"Balinski, M.L.: Integer programming: methods, uses, computations. Manag. Sci. 12(3), 253\u2013313 (1965)","journal-title":"Manag. Sci."},{"key":"499_CR8","doi-asserted-by":"crossref","unstructured":"Barrett, C., Conway, C.L., Deters, M., Hadarean, L., Jovanovi\u0107, D., King, T., Reynolds, A., Tinelli, C.: Cvc4. In: CAV, pp. 171\u2013177 (2011)","DOI":"10.1007\/978-3-642-22110-1_14"},{"key":"499_CR9","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, chap. 26, pp. 825\u2013885. IOS Press, Amsterdam (2009)"},{"key":"499_CR10","doi-asserted-by":"crossref","unstructured":"Bini, E., Buttazzo, G.C.: The space of rate monotonic schedulability. In: RTSS, pp. 169\u2013178 (2002)","DOI":"10.1109\/REAL.2002.1181572"},{"key":"499_CR11","unstructured":"Bj\u00f8rner, N., Phan, A.D., Fleckenstein, L.: $$\\nu z$$ \u03bd z \u2014maximal satisfaction with z3. In: Proceedings of International Symposium on Symbolic Computation in Software Science (2014)"},{"key":"499_CR12","doi-asserted-by":"crossref","unstructured":"Bj\u00f8rner, N., Phan, A.D., Fleckenstein, L.: $$\\nu $$ \u03bd z\u2014an optimizing SMT solver. In: Proceedings of TACAS, pp. 194\u2013199 (2015)","DOI":"10.1007\/978-3-662-46681-0_14"},{"issue":"3","key":"499_CR13","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0166-218X(80)90037-2","volume":"2","author":"CE Blair","year":"1980","unstructured":"Blair, C.E.: Facial disjunctive programs and sequence of cutting-planes. Discrete Appl. Math. 2(3), 173\u2013179 (1980)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"499_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0962492900002518","volume":"4","author":"PT Boggs","year":"1995","unstructured":"Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. Acta Numer. 4(1), 1\u201351 (1995)","journal-title":"Acta Numer."},{"key":"499_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"499_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"RH Byrd","year":"2000","unstructured":"Byrd, R.H., Gilbert, J.C., Nocedal, J.: A trust region method based on interior point techniques for nonlinear programming. Math. Program. 89(1), 149\u2013185 (2000)","journal-title":"Math. Program."},{"issue":"3","key":"499_CR17","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Program. 86(3), 595\u2013614 (1999)","journal-title":"Math. Program."},{"issue":"12","key":"499_CR18","first-page":"3233","volume":"26","author":"L Chen","year":"2015","unstructured":"Chen, L., Wang, Y., Wu, J., Lyu, Y.: Rate-monotonic optimal design based on tree-like linear prgoramming search. J. Softw. 26(12), 3233\u20133241 (2015)","journal-title":"J. Softw."},{"key":"499_CR19","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: The mathsat5 SMT solver. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 93\u2013107 (2013)","DOI":"10.1007\/978-3-642-36742-7_7"},{"key":"499_CR20","volume-title":"Linear Programming and Extensions","author":"GB Dantzig","year":"1965","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1965)"},{"key":"499_CR21","doi-asserted-by":"crossref","unstructured":"De\u00a0Moura, L., Bjrner, N.: Z3: An efficient SMT solver. In: Proceedings of TACAS, pp. 337\u2013340 (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"issue":"9","key":"499_CR22","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/1995376.1995394","volume":"54","author":"L Moura De","year":"2011","unstructured":"De Moura, L., Bjrner, N.: Satisfiability modulo theories: introduction and applications. Commun. ACM 54(9), 69\u201377 (2011)","journal-title":"Commun. ACM"},{"key":"499_CR23","doi-asserted-by":"crossref","unstructured":"Dutertre, B.: Yices 2.2. In: CAV, pp. 737\u2013744 (2014)","DOI":"10.1007\/978-3-319-08867-9_49"},{"key":"499_CR24","doi-asserted-by":"crossref","unstructured":"Dutertre, B., De Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: CAV, pp. 81\u201394 (2006)","DOI":"10.1007\/11817963_11"},{"issue":"1","key":"499_CR25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0165-0114(97)00184-X","volume":"103","author":"S Fang","year":"1999","unstructured":"Fang, S., Li, G.: Solving fuzzy relation equations with a linear objective function. Fuzzy Sets Syst. 103(1), 107\u2013113 (1999)","journal-title":"Fuzzy Sets Syst."},{"issue":"4","key":"499_CR26","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0036144502414942","volume":"44","author":"A Forsgren","year":"2002","unstructured":"Forsgren, A., Gill, P.E., Wright, M.H.: Interior methods for nonlinear optimization. SIAM Rev. 44(4), 525\u2013597 (2002)","journal-title":"SIAM Rev."},{"issue":"2","key":"499_CR27","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.ins.2007.07.022","volume":"178","author":"A Ghodousian","year":"2008","unstructured":"Ghodousian, A., Khorram, E.: Fuzzy linear optimization in the presence of the fuzzy relation inequality constraints with max\u2013min composition. Inf. Sci. 178(2), 501\u2013519 (2008)","journal-title":"Inf. Sci."},{"key":"499_CR28","doi-asserted-by":"crossref","unstructured":"Gill, P.E., Wong, E.: Sequential quadratic programming methods. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 147\u2013224. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-1927-3_6"},{"key":"499_CR29","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.ins.2011.09.030","volume":"252","author":"F Guo","year":"2013","unstructured":"Guo, F., Pang, L., Meng, D., Xia, Z.: An algorithm for solving optimization problems with fuzzy relational inequality constraints. Inf. Sci. 252, 20\u201331 (2013)","journal-title":"Inf. Sci."},{"key":"499_CR30","volume-title":"Fundamentals of Discrete Math for Computer Science","author":"T Jenkyns","year":"2012","unstructured":"Jenkyns, T., Stephenson, B.: Fundamentals of Discrete Math for Computer Science. Springer, London (2012)"},{"key":"499_CR31","volume-title":"Logic-Based Decision Support: Mixed Integer Model Formulation","author":"RG Jeroslow","year":"1989","unstructured":"Jeroslow, R.G.: Logic-Based Decision Support: Mixed Integer Model Formulation. Elsevier, Amsterdam (1989)"},{"key":"499_CR32","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0121015","volume":"22","author":"RG Jeroslow","year":"1984","unstructured":"Jeroslow, R.G., Lowe, J.K.: Modeling with integer variables. Math. Program. Stud. 22, 167\u2013184 (1984)","journal-title":"Math. Program. Stud."},{"issue":"4","key":"499_CR33","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1137\/S1052623496298534","volume":"8","author":"C Kirjner-Neto","year":"1998","unstructured":"Kirjner-Neto, C., Polak, E.: On the conversion of optimization problems with max\u2013min constraints to standard optimization problems. SIAM J. Optim. 8(4), 887\u2013915 (1998)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"499_CR34","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1016\/S0098-1354(00)00581-0","volume":"24","author":"S Lee","year":"2000","unstructured":"Lee, S., Grossmann, I.E.: New algorithms for nonlinear generalized disjunctive programming. Comput. Chem. Eng. 24(9), 2125\u20132141 (2000)","journal-title":"Comput. Chem. Eng."},{"key":"499_CR35","doi-asserted-by":"crossref","unstructured":"Li, Y., Albarghouthi, A., Kincaid, Z., Gurfinkel, A., Chechik, M.: Symbolic optimization with SMT solvers. In: Proceedings of ACM SIGPLAN-SIGACT symposium on POPL, pp. 607\u2013618 (2014)","DOI":"10.1145\/2535838.2535857"},{"issue":"1","key":"499_CR36","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46\u201361 (1973)","journal-title":"J. ACM"},{"issue":"7","key":"499_CR37","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1360\/jos171641","volume":"17","author":"J Liu","year":"2006","unstructured":"Liu, J., Wang, Y., Xing, J.: Study of optimization problems with logic or relationships and its application to real-time system design. J. Softw. 17(7), 1641\u20131649 (2006)","journal-title":"J. Softw."},{"issue":"3","key":"499_CR38","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1007\/s11227-010-0506-z","volume":"59","author":"N Min-Allah","year":"2012","unstructured":"Min-Allah, N., Khan, S.U., Wang, Y.: Optimal task execution times for periodic tasks using nonlinear constrained optimization. J. Supercomput. 59(3), 1120\u20131138 (2012)","journal-title":"J. Supercomput."},{"key":"499_CR39","doi-asserted-by":"crossref","unstructured":"Miyagi, H., Kinjo, I., Fan, Y.: Qualified decision-making using the fuzzy relation inequalities. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, vol. 2, pp. 2014\u20132018. IEEE (1998)","DOI":"10.1109\/ICSMC.1998.728193"},{"key":"499_CR40","doi-asserted-by":"crossref","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to interval analysis. Society for Industrial and Applied Mathematics, Philadelphia, USA (2009)","DOI":"10.1137\/1.9780898717716"},{"issue":"2","key":"499_CR41","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM TOPLAS 1(2), 245\u2013257 (1979)","journal-title":"ACM TOPLAS"},{"issue":"6","key":"499_CR42","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving sat and sat modulo theories: from an abstract davis-putnam-logemann-loveland procedure to DPLL(T). J. ACM 53(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"issue":"7","key":"499_CR43","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","volume":"18","author":"R Raman","year":"1994","unstructured":"Raman, R., Grossmann, I.E.: Modelling and computational techniques for logic based integer programming. Comput. Chem. Eng. 18(7), 563\u2013578 (1994)","journal-title":"Comput. Chem. Eng."},{"issue":"9","key":"499_CR44","doi-asserted-by":"crossref","first-page":"1891","DOI":"10.1016\/j.compchemeng.2005.04.004","volume":"29","author":"N Sawaya","year":"2005","unstructured":"Sawaya, N., Grossmann, I.E.: A cutting plane method for solving linear generalized disjunctive programming problems. Comput. Chem. Eng. 29(9), 1891\u20131913 (2005)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"499_CR45","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2011.07.018","volume":"216","author":"N Sawaya","year":"2012","unstructured":"Sawaya, N., Grossmann, I.E.: A hierarchy of relaxations for linear generalized disjunctive programming. Eur. J. Oper. Res. 216(1), 70\u201382 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"499_CR46","doi-asserted-by":"crossref","unstructured":"Sebastiani, R., Tomasi, S.: Optimization in smt with $${\\cal{LA}} ({\\mathbb{Q}})$$ LA ( Q ) cost functions. In: Automated Reasoning, pp. 484\u2013498 (2012)","DOI":"10.1007\/978-3-642-31365-3_38"},{"issue":"2","key":"499_CR47","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/2699915","volume":"16","author":"R Sebastiani","year":"2015","unstructured":"Sebastiani, R., Tomasi, S.: Optimization modulo theories with linear rational costs. ACM Trans. Comput. Logic 16(2), 12 (2015)","journal-title":"ACM Trans. Comput. Logic"},{"key":"499_CR48","unstructured":"Sheather, S.J., Jones, M.C.: A reliable data-based bandwidth selection method for kernel density estimation. J. R. Stat. Soc. (Ser. B Methodol). 53(3), 683\u2013690 (1991)"},{"key":"499_CR49","volume-title":"Optimization with Disjunctive Constraints","author":"HD Sherali","year":"2012","unstructured":"Sherali, H.D., Shetty, C.M.: Optimization with Disjunctive Constraints. Springer, Berlin (2012). vol. 181"},{"key":"499_CR50","unstructured":"S\u00f6rensson, N., Een, N.: Minisat v1.13\u2014a sat solver with conflict-clause minimization. In: SAT Poster (2005)"},{"issue":"3","key":"499_CR51","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86(3), 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"499_CR52","doi-asserted-by":"crossref","unstructured":"Su, C., Guo, F.: Solving interval-valued fuzzy relation equations with a linear objective function. In: Proceedings of the Sixth International Conference on Fuzzy Systems and Knowledge Discovery, vol. 4, pp. 380\u2013385. IEEE (2009)","DOI":"10.1109\/FSKD.2009.558"},{"issue":"8","key":"499_CR53","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/0098-1354(95)00219-7","volume":"20","author":"M T\u00fcrkay","year":"1996","unstructured":"T\u00fcrkay, M., Grossmann, I.E.: Logic-based minlp algorithms for the optimal synthesis of process networks. Comput. Chem. Eng. 20(8), 959\u2013978 (1996)","journal-title":"Comput. Chem. Eng."},{"key":"499_CR54","unstructured":"Vecchietti, A., Grossmann, I.E.: Computational experience with logmip solving linear and nonlinear disjunctive programming problems. In: Proceedings of FOCAPD, pp. 587\u2013590 (2004)"},{"issue":"7","key":"499_CR55","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0898-1221(98)00170-9","volume":"36","author":"H Wang","year":"1998","unstructured":"Wang, H., Wang, C.: A fixed-charge model with fuzzy inequality constraints composed by max-product operator. Comput. Math. Appl. 36(7), 23\u201329 (1998)","journal-title":"Comput. Math. Appl."},{"issue":"4","key":"499_CR56","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/5326.897079","volume":"30","author":"Y Wang","year":"2000","unstructured":"Wang, Y., Lane, D.M.: Solving a generalized constrained optimization problem with both logic and and or relationships by a mathematical transformation and its application to robot motion planning. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 30(4), 525\u2013536 (2000)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"issue":"2","key":"499_CR57","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1017\/S0263574703005472","volume":"22","author":"Y Wang","year":"2004","unstructured":"Wang, Y., Liu, H., Li, M., Wang, Q., Zhou, J., Cartmell, M.P.: A real-time path planning approach without the computation of cspace obstacles. Robotica 22(2), 173\u2013187 (2004)","journal-title":"Robotica"},{"key":"499_CR58","volume-title":"All of Nonparametric Statistics","author":"L Wasserman","year":"2006","unstructured":"Wasserman, L.: All of Nonparametric Statistics. Springer, New York (2006). vol. 4"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0499-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0499-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0499-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T07:53:43Z","timestamp":1568793223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0499-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,8]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["499"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0499-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,8]]}}}