{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:14:26Z","timestamp":1761621266719,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T00:00:00Z","timestamp":1466035200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["DFRH\/WIIA\/67\/2011"],"award-info":[{"award-number":["DFRH\/WIIA\/67\/2011"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011102","name":"European Union Seventh Framework Programme","doi-asserted-by":"crossref","award":["PCOFUND-GA-2009-246542"],"award-info":[{"award-number":["PCOFUND-GA-2009-246542"]}],"id":[{"id":"10.13039\/100011102","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10589-016-9856-7","type":"journal-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T13:56:41Z","timestamp":1466085401000},"page":"1-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study"],"prefix":"10.1007","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5735-6089","authenticated-orcid":false,"given":"Ricardo M.","family":"Lima","sequence":"first","affiliation":[]},{"given":"Ignacio E.","family":"Grossmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,16]]},"reference":[{"key":"9856_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10107-012-0594-z","volume":"143","author":"N Krislock","year":"2014","unstructured":"Krislock, N., Malick, J., Roupin, F.: Improved semidefinite bounding procedure for solving max-cut problems to optimality. Math. Program. Ser. A 143, 61\u201386 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"9856_CR2","unstructured":"Wolsey, L.A.: Integer Programming. Wiley Series in Discrete Mathematics and Optimization. Wiley, Chichester (1998)"},{"issue":"2","key":"9856_CR3","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9856_CR4","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1145\/146637.146646","volume":"39","author":"A Billionnet","year":"1992","unstructured":"Billionnet, A., Costa, M.C., Sutter, A.: An efficient algorithm for a task allocation problem. J. ACM 39(3), 502\u2013518 (1992)","journal-title":"J. ACM"},{"issue":"2","key":"9856_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"AT Phillips","year":"1994","unstructured":"Phillips, A.T., Rosen, J.B.: A quadratic assignment formulation of the molecular conformation problem. J. Glob. Optim. 4(2), 229\u2013241 (1994)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"9856_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F Barahona","year":"1989","unstructured":"Barahona, F., Junger, M., Reinelt, G.: Experiments in quadratic 0\u20131 programming. Math. Program. 44(2), 127\u2013137 (1989)","journal-title":"Math. Program."},{"issue":"3","key":"9856_CR7","doi-asserted-by":"crossref","first-page":"1494","DOI":"10.1016\/j.ejor.2006.09.028","volume":"187","author":"A Caprara","year":"2008","unstructured":"Caprara, A.: Constrained 0\u20131 quadratic programming: basic approaches and extensions. Eur. J. Oper. Res. 187(3), 1494\u20131503 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9856_CR8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The boolean quadric polytope\u2014some characteristics, facets and relatives. Math. Program. 45(1), 139\u2013172 (1989)","journal-title":"Math. Program."},{"issue":"3","key":"9856_CR9","first-page":"171","volume":"43","author":"A Billionnet","year":"2005","unstructured":"Billionnet, A.: Different formulations for solving the heaviest k-subgraph problem. INFOR 43(3), 171\u2013186 (2005)","journal-title":"INFOR"},{"issue":"5","key":"9856_CR10","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1016\/j.cor.2004.09.033","volume":"33","author":"D Pisinger","year":"2006","unstructured":"Pisinger, D.: Upper bounds and exact algorithms for p-dispersion problems. Comput. Oper. Res. 33(5), 1380\u20131398 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9856_CR11","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","volume":"200","author":"Rafael Marti","year":"2010","unstructured":"Marti, Rafael, Gallego, Micael, Duarte, Abraham: A branch and bound algorithm for the maximum diversity problem. Eur. J. Oper. Res. 200(1), 36\u201344 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2 , SI","key":"9856_CR12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-012-0604-1","volume":"136","author":"J Malick","year":"2012","unstructured":"Malick, J., Roupin, F.: Solving k-cluster problems to optimality with semidefinite programming. Math. Program. 136(2, SI), 279\u2013300 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"9856_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-007-9126-9","volume":"43","author":"D Bertsimas","year":"2009","unstructured":"Bertsimas, D., Shioda, R.: Algorithm for cardinality-constrained quadratic optimization. Comput. Optim. Appl. 43(1), 1\u201322 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"9856_CR14","unstructured":"IBM ILOG CPLEX Optimization Studio - CPLEX Users Manual - Version 12 Release 6. IBM (2013)"},{"issue":"9","key":"9856_CR15","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1016\/j.dam.2005.05.036","volume":"154","author":"M Bruglieri","year":"2006","unstructured":"Bruglieri, M., Ehrgott, M., Hamacher, H.W., Maffioli, F.: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discret. Appl. Math. 154(9), 1344\u20131357 (2006)","journal-title":"Discret. Appl. Math."},{"key":"9856_CR16","doi-asserted-by":"crossref","unstructured":"Porn, R., Nissfolk, O., Jansson, F., Westerlund, T.: The Coulomb glass\u2014modeling and computational experience with a large scale 0-1 QP problem. In: Pistikopoulos, E.N., Georgiadis, M.C., Kokossis, A.C. (eds.) 21st European Symposium on Computer Aided Process Engineering, vol.\u00a029, pp. 658\u2013662 (2011)","DOI":"10.1016\/B978-0-444-53711-9.50132-2"},{"key":"9856_CR17","unstructured":"GUROBI Documentation. GUROBI (2016). http:\/\/www.gurobi.com\/documentation\/6.0\/ . Accessed 29 May 2016"},{"key":"9856_CR18","unstructured":"FICO Xpress Optimization Suite\u2014Xpress-Optimizer\u2014Reference manual. FICO (2009). http:\/\/www.fico.com\/en\/wp-content\/secure_upload\/Xpress-Optimizer-Refernce-Manual . Accessed 29 May 2016"},{"issue":"1","key":"9856_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP solving constraint integer programs. Math. Program. 1(1), 1\u201341 (2009)","journal-title":"Math. Program."},{"issue":"4","key":"9856_CR20","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01099647","volume":"7","author":"IP Androulakis","year":"1995","unstructured":"Androulakis, I.P., Maranas, C.D., Floudas, C.A.: $$\\alpha $$ \u03b1 BB: A global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7(4), 337\u2013363 (1995)","journal-title":"J. Glob. Optim."},{"key":"9856_CR21","unstructured":"Inc. Lindo\u00a0systems. LINDOGlobal (2007). https:\/\/www.gams.com\/help\/index.jsp . Accessed 30 May 2016"},{"issue":"4\u20135","key":"9856_CR22","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., Waechter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Method. Softw. 24(4\u20135), 597\u2013634 (2009)","journal-title":"Optim. Method. Softw."},{"key":"9856_CR23","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\u20133","key":"9856_CR24","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"Ruth Misener","year":"2014","unstructured":"Misener, Ruth, Floudas, Christodoulos A.: ANTIGONE: algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2\u20133), 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9856_CR25","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"2","author":"F Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting 0\u20131 polynomial programming problem to a 0\u20131 linear program. Oper. Res. 2(1), 180\u2013182 (1974)","journal-title":"Oper. Res."},{"issue":"2","key":"9856_CR26","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0098-1354(91)87007-V","volume":"15","author":"R Raman","year":"1991","unstructured":"Raman, R., Grossmann, I.E.: Relation between MILP modeling and logical inference for chemical process synthesis. Comput. Chem. Eng. 15(2), 73\u201384 (1991)","journal-title":"Comput. Chem. Eng."},{"key":"9856_CR27","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., Adams, W.P.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Springer US (1999)","DOI":"10.1007\/978-1-4757-4388-3"},{"issue":"1","key":"9856_CR28","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math. Program. 109(1), 55\u201368 (2007)","journal-title":"Math. Program."},{"issue":"5","key":"9856_CR29","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem\u2014a survey. Discret. Appl. Math. 155(5), 623\u2013648 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"9856_CR30","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0166-218X(97)00039-5","volume":"79","author":"A Mehrotra","year":"1997","unstructured":"Mehrotra, A.: Cardinality constrained Boolean quadratic polytope. Discret. Appl. Math. 79(1\u20133), 137\u2013154 (1997)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9856_CR31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/moor.18.1.245","volume":"18","author":"E Boros","year":"1993","unstructured":"Boros, E., Hammer, P.L.: Cut-polytopes, boolean quadric polytopes and nonnegative quadratic pseudo-boolean functions. Math. Oper. Res. 18(1), 245\u2013253 (1993)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9856_CR32","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Rodgers, G.P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45(2), 131\u2013144 (1990)","journal-title":"Computing"},{"issue":"1","key":"9856_CR33","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6377(94)00065-E","volume":"17","author":"HD Sherali","year":"1995","unstructured":"Sherali, H.D., Lee, Y.H., Adams, W.P.: A simultaneous lifting strategy for identifying new classes of facets for the boolean quadric polytope. Oper. Res. Lett. 17(1), 19\u201326 (1995)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9856_CR34","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-005-3973-5","volume":"140","author":"S Gueye","year":"2005","unstructured":"Gueye, S., Michelon, P.: \u201cMiniaturized\u201d linearizations for quadratic 0\/1 problems. Ann. Oper. Res. 140(1), 235\u2013261 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"9856_CR35","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1016\/j.dam.2008.01.028","volume":"157","author":"S Gueye","year":"2009","unstructured":"Gueye, S., Michelon, P.: A linearization framework for unconstrained quadratic (0\u20131) problems. Discret. Appl. Math. 157(6), 1255\u20131266 (2009)","journal-title":"Discret. Appl. Math."},{"key":"9856_CR36","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.dam.2007.12.008","volume":"157","author":"P Hansen","year":"2009","unstructured":"Hansen, P., Meyer, C.: Improved compact linearizations for the unconstrained quadratic 0\u20131 minimization problem. Discrete Applied Mathematics 157, 1267\u20131290 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"9856_CR37","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10288-006-0015-3","volume":"5","author":"L Liberti","year":"2007","unstructured":"Liberti, L.: Compact linearization for binary quadratic problems. 4OR 5(3), 231\u2013245 (2007)","journal-title":"4OR"},{"issue":"2","key":"9856_CR38","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1137\/080729529","volume":"20","author":"S Burer","year":"2009","unstructured":"Burer, S., Letchford, A.N.: On nonconvex quadratic programming with box constraints. SIAM J. Optim. 20(2), 1073\u20131089 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9856_CR39","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"EL Johnson","year":"1993","unstructured":"Johnson, E.L., Mehrotra, A., Nemhauser, G.L.: Min-cut clustering. Math. Program. 62(1), 133\u2013151 (1993)","journal-title":"Math. Program."},{"key":"9856_CR40","unstructured":"Faye, A., Trinh, Q.: Polyhedral results for a constrained quadratic 0-1 problem. Technical Report CEDRIC-03-511, CEDRIC laboratory, CNAM-Paris, France (2003)"},{"issue":"1\u20133","key":"9856_CR41","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.dam.2004.02.020","volume":"149","author":"A Faye","year":"2005","unstructured":"Faye, A., Trinh, Q.A.: A polyhedral approach for a constrained quadratic 0\u20131 problem. Discret. Appl. Math. 149(1\u20133), 87\u2013100 (2005)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"9856_CR42","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/S0377-2217(99)00262-3","volume":"123","author":"EM Macambira","year":"2000","unstructured":"Macambira, E.M., de Souza, C.C.: The edge-weighted clique problem: valid inequalities, facets and polyhedral computations. Eur. J. Oper. Res. 123(2), 346\u2013371 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9856_CR43","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover, F.: Improved linear integer programming formulations of nonlinear integer problems. Manag. Sci. 22, 455\u2013460 (1975)","journal-title":"Manag. Sci."},{"issue":"4","key":"9856_CR44","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1287\/ijoc.1060.0189","volume":"19","author":"E Rothberg","year":"2007","unstructured":"Rothberg, E.: An evolutionary algorithm for polishing mixed integer programming solutions. INFORMS J. Comput. 19(4), 534\u2013541 (2007)","journal-title":"INFORMS J. Comput."},{"key":"9856_CR45","unstructured":"Brooke, A., Kendrick, D., Meeraus, A., Raman, R.: GAMS\u2014a user\u2019s guide (1998)"},{"key":"9856_CR46","unstructured":"Bliek, C., Bonami, P., Lodi, A.: Solving mixed-integer quadratic programming problems with IBM-CPLEX: a progress report. In: Proceedings of the Twenty-Sixth RAMP Symposium, pp. 171\u2013180. Hosei University, Tokyo, Japan (2014)"},{"issue":"6","key":"9856_CR47","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A Billionnet","year":"2009","unstructured":"Billionnet, A., Elloumi, S., Plateau, M.C.: Improving the performance of standard solvers for quadratic 0\u20131 programs by a tight convex reformulation: The QCR method. Discret. Appl. Math. 157(6), 1185\u20131197 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"9856_CR48","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10898-009-9507-y","volume":"48","author":"TP Dinh","year":"2010","unstructured":"Dinh, T.P., Canh, N.N., Le, T., An, H.: An efficient combined DCA and B&B using DC\/SDP relaxation for globally solving binary quadratic programs. J. Glob. Optim. 48(4), 595\u2013632 (2010)","journal-title":"J. Glob. Optim."},{"key":"9856_CR49","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. Ser. A 121, 307\u2013335 (2010)","journal-title":"Math. Program. Ser. A"},{"key":"9856_CR50","unstructured":"Lima, R.M., Grossmann, I.\u00a0E.: Chemical engineering greetings to Prof. Sauro Pierucci, chapter. Computational advances in solving Mixed Integer Linear Programming problems, pp. 151\u2013160, AIDIC (2011)"},{"issue":"1","key":"9856_CR51","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"49","author":"R Bixby","year":"2007","unstructured":"Bixby, R., Rothberg, E.: Progress in computational mixed integer programming\u2014a look back from the other side of the tipping point. Ann. Oper. Res. 49(1), 37\u201341 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9856_CR52","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"9856_CR53","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10898-013-0131-5","volume":"59","author":"MR Bussieck","year":"2014","unstructured":"Bussieck, M.R., Dirkse, S.P., Vigerske, S.: Paver 2.0: an open source environment for automated performance analysis of benchmarking data. J. Glob. Optim. 59(2\u20133), 259\u2013275 (2014)","journal-title":"J. Glob. Optim."},{"key":"9856_CR54","unstructured":"Lima, R.M.: IBM ILOG CPLEX What is inside of the box? (2010). http:\/\/egon.cheme.cmu.edu\/ewocp\/docs\/rlima_cplex_ewo_dec2010 . Accessed 22 Oct 2015"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9856-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9856-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9856-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9856-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T23:27:23Z","timestamp":1589671643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9856-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,16]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9856"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9856-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,6,16]]}}}