{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:11:17Z","timestamp":1648966277379},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,6]],"date-time":"2013-03-06T00:00:00Z","timestamp":1362528000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s00186-013-0431-z","type":"journal-article","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T12:40:46Z","timestamp":1362487246000},"page":"35-59","source":"Crossref","is-referenced-by-count":4,"title":["Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem"],"prefix":"10.1007","volume":"78","author":[{"given":"Alexander","family":"Engau","sequence":"first","affiliation":[]},{"given":"Miguel F.","family":"Anjos","sequence":"additional","affiliation":[]},{"given":"Immanuel","family":"Bomze","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,6]]},"reference":[{"issue":"1","key":"431_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1995","unstructured":"Alizadeh F (1995) Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J Optim 5(1):13\u201351","journal-title":"SIAM J Optim"},{"issue":"4","key":"431_CR2","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/ijoc.1080.0270","volume":"20","author":"MF Anjos","year":"2008","unstructured":"Anjos MF, Vannelli A (2008) Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS J Comput 20(4):611\u2013617","journal-title":"INFORMS J Comput"},{"key":"431_CR3","doi-asserted-by":"crossref","unstructured":"Balas E, Ceria S, Cornu\u00e9jols G (1993) A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math Program 58(3, Ser. A):295\u2013324","DOI":"10.1007\/BF01581273"},{"issue":"1","key":"431_CR4","doi-asserted-by":"crossref","first-page":"S14","DOI":"10.1287\/opre.40.1.S14","volume":"40","author":"F Barahona","year":"1992","unstructured":"Barahona F, Epstein R, Weintraub A (1992) Habitat dispersion in forest planning and the stable set problem. Oper Res 40(1):S14\u2013S21","journal-title":"Oper Res"},{"issue":"3","key":"431_CR5","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10589-007-9048-6","volume":"38","author":"HY Benson","year":"2007","unstructured":"Benson HY, Shanno DF (2007) An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming. Comput Optim Appl 38(3):371\u2013399","journal-title":"Comput Optim Appl"},{"issue":"3","key":"431_CR6","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2011.04.026","volume":"216","author":"IM Bomze","year":"2012","unstructured":"Bomze IM (2012) Copositive optimization-recent developments and applications. Eur J Oper Res 216(3):509\u2013520","journal-title":"Eur J Oper Res"},{"issue":"2","key":"431_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze IM, De Klerk E (2002) Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J Global Optim 24(2):163\u2013185","journal-title":"J Global Optim"},{"key":"431_CR8","unstructured":"Bomze IM, D\u00fcr M, Teo CP (2012) Copositive optimization. Optima MOS Newsl 89:2\u201310. http:\/\/www.mathopt.org\/Optima-Issues\/optima89.pdf"},{"key":"431_CR9","doi-asserted-by":"crossref","unstructured":"Bomze IM, Frommlet F, Locatelli M (2010) Copositivity cuts for improving SDP bounds on the clique number. Math Program 124(1\u20132, Ser. B):13\u201332","DOI":"10.1007\/s10107-010-0363-9"},{"key":"431_CR10","doi-asserted-by":"crossref","unstructured":"Bomze IM, Locatelli M, Tardella F (2008) New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Math Program 115(1, Ser. A):31\u201364","DOI":"10.1007\/s10107-007-0138-0"},{"issue":"3","key":"431_CR11","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10898-011-9749-3","volume":"52","author":"IM Bomze","year":"2012","unstructured":"Bomze IM, Schachinger W, Uchida G (2012) Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization. J Global Optim 52(3):423\u2013445","journal-title":"J Global Optim"},{"key":"431_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"issue":"1","key":"431_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-010-0010-8","volume":"2","author":"S Burer","year":"2010","unstructured":"Burer S (2010) Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math Program Comput 2(1):1\u201319","journal-title":"Math Program Comput"},{"key":"431_CR14","unstructured":"Burer S (2011) Copositive programming. In: Anjos MF, Lasserre JB (eds) Handbook of semidefinite, cone and polynomial optimization: theory, algorithms, software and applications. International Series in Operations Research and Management Science. Springer, New York, pp 201\u2013218"},{"key":"431_CR15","doi-asserted-by":"crossref","unstructured":"Dantzig GB, Ye Y (1991) A build-up interior method for linear programming: affine scaling form. Technical report, Stanford University\/The University of Iowa","DOI":"10.21236\/ADA221802"},{"key":"431_CR16","unstructured":"Davi T, Jarre F (2011) Solving large scale problems over the doubly nonnegative cone. Technical report, Institut f\u00fcr Informatik, Universit\u00e4t D\u00fcsseldorf (submitted). http:\/\/www.optimization-online.org\/DB_HTML\/2011\/04\/3000.html"},{"key":"431_CR17","doi-asserted-by":"crossref","unstructured":"de Klerk E (2002) Aspects of semidefinite programming, applied optimization. Interior point algorithms and selected applications, vol 65. Kluwer, Dordrecht","DOI":"10.1007\/b105286"},{"key":"431_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.01.025","volume":"201","author":"E Klerk de","year":"2010","unstructured":"de Klerk E (2010) Exploiting special structure in semidefinite programming: a survey of theory and applications. Eur J Oper Res 201:1\u201310","journal-title":"Eur J Oper Res"},{"issue":"4","key":"431_CR19","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E Klerk de","year":"2002","unstructured":"de Klerk E, Pasechnik DV (2002) Approximation of the stability number of a graph via copositive programming. SIAM J Optim 12(4):875\u2013892","journal-title":"SIAM J Optim"},{"key":"431_CR20","doi-asserted-by":"crossref","unstructured":"den Hertog D, Roos C, Terlaky T (1994) Adding and deleting constraints in the logarithmic barrier method for LP. In: Advances in optimization and approximation, vol 1. Nonconvex Optim Appl. Kluwer, Dordrecht, pp 166\u2013185","DOI":"10.1007\/978-1-4613-3629-7_8"},{"key":"431_CR21","doi-asserted-by":"crossref","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91(2, Ser. A):201\u2013213","DOI":"10.1007\/s101070100263"},{"key":"431_CR22","doi-asserted-by":"crossref","unstructured":"Dukanovic I, Rendl F (2007) Semidefinite programming relaxations for graph coloring and maximal clique problems. Math Program 109(2\u20133, Ser. B):345\u2013365","DOI":"10.1007\/s10107-006-0026-z"},{"key":"431_CR23","doi-asserted-by":"crossref","unstructured":"Dukanovic I, Rendl F (2010) Copositive programming motivated bounds on the stability and the chromatic numbers. Math Program 121(2, Ser. A):249\u2013268","DOI":"10.1007\/s10107-008-0233-x"},{"key":"431_CR24","doi-asserted-by":"crossref","unstructured":"D\u00fcr M (2010) Copositive programming\u2014a survey. In: Moritz D, Francois G, Elias J, Wim M (eds) Recent advances in optimization and its applications in engineering. Springer, Berlin, pp 3\u201320","DOI":"10.1007\/978-3-642-12598-0_1"},{"issue":"1","key":"431_CR25","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1137\/1036003","volume":"36","author":"AS El-Bakry","year":"1994","unstructured":"El-Bakry AS, Tapia RA, Zhang Y (1994) A study of indicators for identifying zero variables in interior-point methods. SIAM Rev 36(1):45\u201372","journal-title":"SIAM Rev"},{"key":"431_CR26","doi-asserted-by":"crossref","unstructured":"Engau A (2012) Recent progress in interior-point methods: cutting plane methods and warm starts. In: Anjos MF, Lasserre JB (eds) Handbook of semidefinite, conic, and polynomial optimization, International Series in Operations Research & Management Science, Chapter 17, vol 166. Springer, New York, pp 471\u2013498","DOI":"10.1007\/978-1-4614-0769-0_17"},{"key":"431_CR27","unstructured":"Engau A, Anjos MF (2011) A primal-dual interior-point algorithm for linear programming with selective addition of inequalities. Technical Report G-2011-44, GERAD, Montr\u00e9al, QC, Canada"},{"key":"431_CR28","doi-asserted-by":"crossref","unstructured":"Engau A, Anjos MF, Vannelli A (2009) A primal-dual slack approach to warmstarting interior-point methods for linear programming. In: Chinneck JW, Kristjansson B, Saltzman MJ (eds) Operations research and cyber-infrastructure. Springer, Berlin, pp 195\u2013217","DOI":"10.1007\/978-0-387-88843-9_10"},{"key":"431_CR29","doi-asserted-by":"crossref","unstructured":"Engau A, Anjos MF, Vannelli A (2010a) An improved interior-point cutting-plane method for binary quadratic optimization. Electron Notes Discret Math 36:743\u2013750","DOI":"10.1016\/j.endm.2010.05.094"},{"key":"431_CR30","doi-asserted-by":"crossref","unstructured":"Engau A, Anjos MF, Vannelli A (2010b) On interior-point warmstarts for linear and combinatorial optimization. SIAM J Optim 10(4):1828\u20131861","DOI":"10.1137\/080742786"},{"key":"431_CR31","doi-asserted-by":"crossref","unstructured":"Engau A, Anjos MF, Vannelli A (2012) On handling cutting-planes in interior-point methods for solving semidefinite relaxations of binary quadratic optimization problems. Optim Methods Softw 27(3): 539\u2013559","DOI":"10.1080\/10556788.2010.544308"},{"key":"431_CR32","doi-asserted-by":"crossref","unstructured":"Fischer I, Gruber G, Rendl F, Sotirov R (2006) Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition. Math Program 105(2\u20133, Ser. B):451\u2013469","DOI":"10.1007\/s10107-005-0661-9"},{"issue":"3\u20135","key":"431_CR33","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"issue":"3","key":"431_CR34","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1137\/060678129","volume":"19","author":"J Gondzio","year":"2008","unstructured":"Gondzio J, Grothey A (2008) A new unblocking technique to warmstart interior point methods based on sensitivity analysis. SIAM J Optim 19(3):1184\u20131210","journal-title":"SIAM J Optim"},{"key":"431_CR35","doi-asserted-by":"crossref","unstructured":"Gruber G, Rendl F (2003) Computational experience with stable set relaxations. SIAM J Optim 13(4): 1014\u20131028","DOI":"10.1137\/S1052623401394092"},{"key":"431_CR36","doi-asserted-by":"crossref","unstructured":"Gvozdenovi\u0107 N, Laurent M (2008a) Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization. SIAM J Optim 19(2):592\u2013615","DOI":"10.1137\/070683520"},{"key":"431_CR37","doi-asserted-by":"crossref","unstructured":"Gvozdenovi\u0107 N, Laurent M (2008b) The operator $$\\Psi $$ for the chromatic number of a graph. SIAM J Optim 19(2):572\u2013591","DOI":"10.1137\/050648237"},{"key":"431_CR38","doi-asserted-by":"crossref","unstructured":"Hamzaoglu I, Patel JH (1998) Test set compaction algorithms for combinational circuits. In: Proceedings of the 1998 IEEE\/ACM international conference on computer-aided design (ICCAD \u201998), New York, NY, USA, pp 283\u2013289","DOI":"10.1145\/288548.288615"},{"key":"431_CR39","doi-asserted-by":"crossref","unstructured":"Helmberg C (2004) A cutting plane algorithm for large scale semidefinite relaxations. In: The sharpest cut. SIAM, Philadelphia, PA, pp 233\u2013256","DOI":"10.1137\/1.9780898718805.ch15"},{"key":"431_CR40","doi-asserted-by":"crossref","unstructured":"Helmberg C, Rendl F (1998) Solving quadratic $$(0,1)$$ -problems by semidefinite programs and cutting planes. Math Program 82(3, Ser. A):291\u2013315","DOI":"10.1007\/BF01580072"},{"issue":"2","key":"431_CR41","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10589-007-9096-y","volume":"41","author":"E John","year":"2008","unstructured":"John E, Y\u0131ld\u0131r\u0131m EA (2008) Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension. Comput Optim Appl 41(2):151\u2013183","journal-title":"Comput Optim Appl"},{"key":"431_CR42","doi-asserted-by":"crossref","unstructured":"Johnson DS, Trick MA, eds (1996) Cliques, coloring, and satisfiability. DIMACS series in discrete mathematics and theoretical computer science, 26. American Mathematical Society, Providence, RI","DOI":"10.1090\/dimacs\/026"},{"key":"431_CR43","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10589-010-9324-8","volume":"51","author":"J Jung","year":"2012","unstructured":"Jung J, O\u2019Leary D, Tits A (2012) Adaptive constraint reduction for convex quadratic programming. Comput Optim Appl 51:125\u2013157","journal-title":"Comput Optim Appl"},{"issue":"6","key":"431_CR44","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1287\/mnsc.39.6.757","volume":"39","author":"JA Kaliski","year":"1993","unstructured":"Kaliski JA, Ye Y (1993) A short-cut potential reduction algorithm for linear programming. Manag Sci 39(6):757\u2013776","journal-title":"Manag Sci"},{"key":"431_CR45","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972). Plenum, New York, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"431_CR46","doi-asserted-by":"crossref","unstructured":"Laurent M, Rendl F (2005) Integer programming and semidefinite programming. In: Aardal K, Nemhauser GL, Weismantel R (eds) Discrete optimization. Handbooks in operations research and management science, vol 12. Elsevier, Amsterdam, pp 393\u2013514","DOI":"10.1016\/S0927-0507(05)12008-8"},{"issue":"2","key":"431_CR47","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz L, Schrijver A (1991) Cones of matrices and set-functions and 0\u20131 optimization. SIAM J Optim 1(2):166\u2013190","journal-title":"SIAM J Optim"},{"issue":"3","key":"431_CR48","first-page":"134","volume":"3","author":"RJ McEliece","year":"1978","unstructured":"McEliece RJ, Rodemich ER, Rumsey HC Jr (1978) The Lov\u00e1sz bound and some generalizations. J Combin Inform Syst Sci 3(3):134\u2013152","journal-title":"J Combin Inform Syst Sci"},{"issue":"4","key":"431_CR49","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1137\/S1052623497324242","volume":"10","author":"JE Mitchell","year":"2000","unstructured":"Mitchell JE (2000) Computational experience with an interior point cutting plane algorithm. SIAM J Optim 10(4):1212\u20131227","journal-title":"SIAM J Optim"},{"key":"431_CR50","doi-asserted-by":"crossref","unstructured":"Mitchell JE (2009) Cutting plane methods and subgradient methods. In: Oskoorouchi M (ed) Tutorials in operations research Chapter 2, INFORMS, pp 34\u201361","DOI":"10.1287\/educ.1090.0064"},{"key":"431_CR51","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02206819","volume":"62","author":"JE Mitchell","year":"1996","unstructured":"Mitchell JE, Borchers B (1996) Solving real-world linear ordering problems using a primal-dual interior point cutting plane method. Ann Oper Res 62:253\u2013276","journal-title":"Ann Oper Res"},{"key":"431_CR52","doi-asserted-by":"crossref","unstructured":"Nesterov Y, Nemirovskii A (1994) Interior-point polynomial algorithms in convex programming volume 13 of SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA","DOI":"10.1137\/1.9781611970791"},{"key":"431_CR53","unstructured":"Palagi L, Piccialli V, Rendl F, Rinaldi G, Wiegele A (2011) Computational approaches to max-cut. In: Handbook of semidefinite, conic and polynomial optimization: theory, algorithms, software and applications. International Series in Operations Research and Management Science. Springer, New York, pp 821\u2013847"},{"issue":"1","key":"431_CR54","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/05064401X","volume":"18","author":"J Pe\u00f1a","year":"2007","unstructured":"Pe\u00f1a J, Vera J, Zuluaga LF (2007) Computing the stability number of a graph via linear and semidefinite programming. SIAM J Optim 18(1):87\u2013105","journal-title":"SIAM J Optim"},{"key":"431_CR55","doi-asserted-by":"crossref","unstructured":"Rendl F (2012) Matrix relaxations in combinatorial optimization. In: Mixed integer nonlinear programming, vol 154. The IMA volumes in mathematics and its applications. Springer, Berlin, pp 483\u2013511","DOI":"10.1007\/978-1-4614-1927-3_17"},{"key":"431_CR56","doi-asserted-by":"crossref","unstructured":"Rendl F, Rinaldi G, Wiegele A (2010) Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math Program 121(2, Ser. A):307\u2013355","DOI":"10.1007\/s10107-008-0235-8"},{"issue":"2","key":"431_CR57","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1021\/ci025605o","volume":"43","author":"N Rhodes","year":"2003","unstructured":"Rhodes N, Willett P, Calvet A, Dunbar JB, Humblet C (2003) Clip: similarity searching of 3D databases using clique detection. J Chem Inf Comput Sci 43(2):443\u2013448","journal-title":"J Chem Inf Comput Sci"},{"issue":"4","key":"431_CR58","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A Schrijver","year":"1979","unstructured":"Schrijver A (1979) A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans Inf Theory 25(4):425\u2013429","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"431_CR59","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J Discret Math 3(3):411\u2013430","journal-title":"SIAM J Discret Math"},{"key":"431_CR60","first-page":"11","volume":"18","author":"NJA Sloane","year":"1989","unstructured":"Sloane NJA (1989) Unsolved problems in graph theory arising from the study of codes. Graph Theory Notes NY 18:11\u201320","journal-title":"Graph Theory Notes NY"},{"key":"431_CR61","unstructured":"Szegedy M, (1994) A note on the Theta number of Lov\u00e1sz and the generalized Delsarte bound. In: 35th Annual symposium on foundations of computer science, 20\u201322 November 1994, Santa Fe. New Mexico, USA, pp 36\u201339"},{"key":"431_CR62","doi-asserted-by":"crossref","first-page":"S136","DOI":"10.1093\/bioinformatics\/18.suppl_1.S136","volume":"1","author":"A Tanay","year":"2002","unstructured":"Tanay A, Sharan R, Shamir R (2002) Discovering statistically significant biclusters in gene expression data. Bioinformatics 1:S136\u2013S144","journal-title":"Bioinformatics"},{"key":"431_CR63","doi-asserted-by":"crossref","unstructured":"T\u00fct\u00fcnc\u00fc RH, Toh K, Todd MJ (2003) Solving semidefinite-quadratic-linear programs using SDPT3. Math Program 95(2, Ser. B):189\u2013217","DOI":"10.1007\/s10107-002-0347-5"},{"issue":"1","key":"431_CR64","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev 38(1):49\u201395","journal-title":"SIAM Rev"},{"issue":"3\u20134","key":"431_CR65","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen Z, Goldfarb D, Yin W (2010) Alternating direction augmented Lagrangian methods for semidefinite programming. Math Program Comput 2(3\u20134):203\u2013230","journal-title":"Math Program Comput"},{"issue":"4","key":"431_CR66","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao XY, Sun D, Toh KC (2010) A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J Optim 20(4):1737\u20131765","journal-title":"SIAM J Optim"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-013-0431-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-013-0431-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-013-0431-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T13:06:01Z","timestamp":1562763961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-013-0431-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,6]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["431"],"URL":"https:\/\/doi.org\/10.1007\/s00186-013-0431-z","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,6]]}}}