{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T22:15:29Z","timestamp":1768083329397,"version":"3.49.0"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T00:00:00Z","timestamp":1329264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10288-012-0198-8","type":"journal-article","created":{"date-parts":[[2012,2,14]],"date-time":"2012-02-14T10:37:26Z","timestamp":1329215846000},"page":"221-244","source":"Crossref","is-referenced-by-count":22,"title":["Relaxations of mixed integer sets from lattice-free polyhedra"],"prefix":"10.1007","volume":"10","author":[{"given":"Alberto","family":"Del Pia","sequence":"first","affiliation":[]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,15]]},"reference":[{"key":"198_CR1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10107-004-0558-z","volume":"102","author":"K Andersen","year":"2005","unstructured":"Andersen K, Cornu\u00e9jols G, Li Y (2005) Split closure and intersection cuts. Math Program A 102: 457\u2013493","journal-title":"Math Program A"},{"key":"198_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.1090.0439","volume":"35","author":"K Andersen","year":"2010","unstructured":"Andersen K, Louveaux Q, Weismantel R (2010) An analysis of mixed integer linear sets based on lattice point free convex sets. Math Oper Res 35: 233\u2013256","journal-title":"Math Oper Res"},{"key":"198_CR3","unstructured":"Andersen K, Louveaux Q, Weismantel R, Wolsey LA (2007) Cutting planes from two rows of a simplex tableau. In: Proceedings of IPCO, lecture notes in computer science , vol 4513, pp 1\u201315"},{"key":"198_CR4","unstructured":"Averkov G (2011) On finite generation and infinite convergence of generalized closures from the theory of cutting planes (manuscript)"},{"key":"198_CR5","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1287\/moor.1110.0510","volume":"36","author":"G Averkov","year":"2011","unstructured":"Averkov G, Wagner C, Weismantel R (2011) Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three. Math Oper Res 36: 721\u2013742","journal-title":"Math Oper Res"},{"key":"198_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas E (1971) Intersection cuts\u2014a new type of cutting planes for integer programming. Oper Res 19: 19\u201339","journal-title":"Oper Res"},{"key":"198_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas E (1979) Disjunctive programming. Ann Discret Math 5: 3\u201351","journal-title":"Ann Discret Math"},{"key":"198_CR8","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E Balas","year":"1985","unstructured":"Balas E (1985) Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J Algebraic Discret Methods 6: 466\u2013486","journal-title":"SIAM J Algebraic Discret Methods"},{"key":"198_CR9","doi-asserted-by":"crossref","unstructured":"Balas E (1998) Disjunctive programming: properties of the convex hull of feasible points. GSIA management science research report MSRR 348, Carnegie Mellon University, 1974. Published as invited paper in Discrete Applied Mathematics 89:3\u201344","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"198_CR10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas E, Ceria S, Cornu\u00e9jols G (1993) A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math Program 58: 295\u2013324","journal-title":"Math Program"},{"key":"198_CR11","doi-asserted-by":"crossref","unstructured":"Balas E, Margot F (2011) Generalized intersection cuts and a new cut generating paradigm. Math Program A (to appear)","DOI":"10.1007\/s10107-011-0483-x"},{"key":"198_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E Balas","year":"2008","unstructured":"Balas E, Saxena A (2008) Optimizing over the split closure. Math Program A 113: 219\u2013240","journal-title":"Math Program A"},{"key":"198_CR13","doi-asserted-by":"crossref","unstructured":"Basu A, Campelo M, Conforti M, Cornu\u00e9jols G, Zambelli G (2010a) On lifting integer variables in minimal inequalities. In: Proceedings of IPCO, lecture notes in computer science, vol 6080, pp 85\u201395","DOI":"10.1007\/978-3-642-13036-6_7"},{"key":"198_CR14","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/moor.1100.0461","volume":"35","author":"A Basu","year":"2010","unstructured":"Basu A, Conforti M, Cornu\u00e9jols G, Zambelli G (2010b) Maximal lattice-free convex sets in linear subspaces. Math Oper Res 35: 704\u2013720","journal-title":"Math Oper Res"},{"key":"198_CR15","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/090756375","volume":"24","author":"A Basu","year":"2010","unstructured":"Basu A, Conforti M, Cornu\u00e9jols G, Zambelli G (2010c) Minimal inequalities for an infinite relaxation of integer programs. SIAM J Discret Optim 24: 158\u2013168","journal-title":"SIAM J Discret Optim"},{"key":"198_CR16","doi-asserted-by":"crossref","unstructured":"Basu A, Cornu\u00e9jols G, Molinaro M (2010d) A probabilistic analysis of the strength of the split and triangle closures. Technical report","DOI":"10.1007\/978-3-642-20807-2_3"},{"key":"198_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10107-009-0281-x","volume":"126","author":"A Basu","year":"2011","unstructured":"Basu A, Bonami P, Cornu\u00e9jols G, Margot F (2011a) On the relative strength of split, triangle and quadrilateral cuts. Math Program A 126: 281\u2013314","journal-title":"Math Program A"},{"key":"198_CR18","doi-asserted-by":"crossref","unstructured":"Basu A, Campelo M, Conforti M, Cornu\u00e9jols G, Zambelli G (2011b) Unique lifting of integer variables in minimal inequalities (manuscript)","DOI":"10.1007\/978-3-642-13036-6_7"},{"key":"198_CR19","doi-asserted-by":"crossref","unstructured":"Basu A, Cornu\u00e9jols G, K\u00f6ppe M (2011c) Unique minimal liftings for simplicial polytopes (manuscript)","DOI":"10.1287\/moor.1110.0536"},{"key":"198_CR20","doi-asserted-by":"crossref","unstructured":"Basu A, Cornu\u00e9jols G, Margot F (2011d) Intersection cuts with infinite split rank. Math Oper Res (to appear)","DOI":"10.1287\/moor.1110.0522"},{"issue":"2","key":"198_CR21","first-page":"427","volume":"18","author":"A Basu","year":"2011","unstructured":"Basu A, Cornu\u00e9jols G, Zambelli G (2011e) Convex sets and minimal sublinear functions. J Convex Anal 18(2): 427\u2013432","journal-title":"J Convex Anal"},{"key":"198_CR22","unstructured":"Basu A, Hildebrand R, K\u00f6ppe M (2011f) Algorithmic and complexity results for cutting planes derived from maximal lattice-free convex sets (manuscript)"},{"key":"198_CR23","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/sapm1977562187","volume":"56","author":"DE Bell","year":"1977","unstructured":"Bell DE (1977) A theorem concerning the integer lattice. Stud Appl Math 56: 187\u2013188","journal-title":"Stud Appl Math"},{"issue":"1&2","key":"198_CR24","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1017\/S1471068404002261","volume":"5","author":"F Benoy","year":"2005","unstructured":"Benoy F, King A, Mesnard F (2005) Computing convex hulls with a linear solver. Theory Pract Logic Program 5(1&2): 259\u2013271","journal-title":"Theory Pract Logic Program"},{"key":"198_CR25","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A Caprara","year":"2003","unstructured":"Caprara A, Letchford AN (2003) On the separation of split cuts and related inequalities. Math Program B 94: 279\u2013294","journal-title":"Math Program B"},{"key":"198_CR26","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V (1973) Edmonds polytopes and a hierarchy of combinatorial problems. Discret Math 4: 305\u2013337","journal-title":"Discret Math"},{"key":"198_CR27","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.orl.2010.02.006","volume":"38","author":"M Conforti","year":"2010","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G (2010a) Eqivalence between intersection cuts and the corner polyhedron. Oper Res Lett 38: 153\u2013155","journal-title":"Oper Res Lett"},{"key":"198_CR28","first-page":"334","volume-title":"50\u00a0years of integer programming 1958\u20132008: from the early years to the state-of-the-art","author":"M Conforti","year":"2010","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G (2010b) Polyhedral approaches to mixed integer linear programming. In: Juenger M, Liebling T, Naddef D, Pulleyblank W, Reinelt G, Rinaldi G, Wolsey L (eds) 50\u00a0years of integer programming 1958\u20132008: from the early years to the state-of-the-art. Springer, Berlin, pp 334\u2013384"},{"key":"198_CR29","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.sorms.2011.03.001","volume":"16","author":"M Conforti","year":"2011","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G (2011a) Corner polyhedron and intersection cuts. Surv Oper Res Manag Sci 16: 105\u2013120","journal-title":"Surv Oper Res Manag Sci"},{"key":"198_CR30","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1110.0916","volume":"59","author":"M Conforti","year":"2011","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G (2011b) A geometric perspective on lifting. Oper Res 59: 569\u2013577","journal-title":"Oper Res"},{"key":"198_CR31","unstructured":"Conforti M, Del Pia A (2011) Disjunctive programming and relaxations of polyhedra. (manuscript)"},{"key":"198_CR32","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"WJ Cook","year":"1990","unstructured":"Cook WJ, Kannan R, Schrijver A (1990) Chv\u00e1tal closures for mixed integer programming problems. Math Program 47: 155\u2013174","journal-title":"Math Program"},{"key":"198_CR33","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s101070100250","volume":"91","author":"G Cornu\u00e9jols","year":"2002","unstructured":"Cornu\u00e9jols G, Li Y (2002) On the rank of mixed 0,1 polyhedra. Math Program A 91: 391\u2013397","journal-title":"Math Program A"},{"key":"198_CR34","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.orl.2009.10.010","volume":"38","author":"S Dash","year":"2010","unstructured":"Dash S (2010) On the complexity of cutting-plane proofs using split cuts. Ope Res Lett 38: 109\u2013114","journal-title":"Ope Res Lett"},{"key":"198_CR35","doi-asserted-by":"crossref","unstructured":"Dash S, G\u00fcnl\u00fck O, Lodi A (2007) On the MIR closure of polyhedra. In: Proceedings of IPCO, lecture notes in computer science, vol 4513, pp 337\u2013351","DOI":"10.1007\/978-3-540-72792-7_26"},{"key":"198_CR36","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-008-0225-x","volume":"121","author":"S Dash","year":"2010","unstructured":"Dash S, G\u00fcnl\u00fck O, Lodi A (2010) MIR closures of polyhedral sets. Math Program A 121: 33\u201360","journal-title":"Math Program A"},{"key":"198_CR37","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.orl.2011.06.010","volume":"39","author":"S Dash","year":"2011","unstructured":"Dash S, Dey SS, G\u00fcnl\u00fck O (2011a) On mixed-integer sets with two integer variables. Oper Res Lett 39: 305\u2013309","journal-title":"Oper Res Lett"},{"key":"198_CR38","doi-asserted-by":"crossref","unstructured":"Dash S, Dey SS, G\u00fcnl\u00fck O (2011b) Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math Program A (to appear)","DOI":"10.1007\/s10107-011-0455-1"},{"key":"198_CR39","unstructured":"Dash S, Dobbs N, G\u00fcnl\u00fck O, Nowicki T, Swirszcz G (2011c) Lattice-free sets, branching disjunctions, and mixed-integer programming (manuscript)"},{"key":"198_CR40","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.orl.2011.02.011","volume":"39","author":"S Dash","year":"2011","unstructured":"Dash S, G\u00fcnl\u00fck O, Raack C (2011d) A note on the MIR closure and basic relaxations of polyhedra. Oper Res Lett 39: 198\u2013199","journal-title":"Oper Res Lett"},{"key":"198_CR41","unstructured":"Dash S, G\u00fcnl\u00fck O, Vielma JP (2011e) Computational experiments with cross and crooked cross cuts (manuscript)"},{"key":"198_CR42","unstructured":"Del Pia A (2011) On the rank of disjunctive cuts. Math Oper Res (to appear)"},{"key":"198_CR43","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.orl.2011.04.005","volume":"39","author":"A Del Pia","year":"2011","unstructured":"Del Pia A, Wagner C, Weismantel R (2011) A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts. Oper Res Lett 39: 234\u2013240","journal-title":"Oper Res Lett"},{"key":"198_CR44","doi-asserted-by":"crossref","unstructured":"Del Pia A, Weismantel R (2011) On convergence in mixed integer programming. Math Program A (to appear)","DOI":"10.1007\/s10107-011-0476-9"},{"key":"198_CR45","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10107-009-0329-y","volume":"130","author":"SS Dey","year":"2011","unstructured":"Dey SS (2011) A note on the split rank of intersection cuts. Math Program A 130: 107\u2013124","journal-title":"Math Program A"},{"key":"198_CR46","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1287\/moor.1110.0496","volume":"36","author":"SS Dey","year":"2011","unstructured":"Dey SS, Louveaux Q (2011) Split rank of triangle and quadrilateral inequalities. Math Oper Res 36: 432\u2013461","journal-title":"Math Oper Res"},{"key":"198_CR47","unstructured":"Dey SS, Wolsey LA (2008) Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In: Proceedings of IPCO, lecture notes in computer science, vol 5035, pp 463\u2013475"},{"key":"198_CR48","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10107-010-0362-x","volume":"124","author":"SS Dey","year":"2010","unstructured":"Dey SS, Wolsey LA (2010) Two row mixed-integer cuts via lifting. Math Program B 124: 143\u2013174","journal-title":"Math Program B"},{"key":"198_CR49","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.disopt.2010.09.002","volume":"8","author":"R Fukasawa","year":"2011","unstructured":"Fukasawa R, G\u00fcnl\u00fck O (2011) Strengthening lattice-free cuts using non-negativity. Discret Optim 8: 229\u2013245","journal-title":"Discret Optim"},{"key":"198_CR50","first-page":"335","volume":"69","author":"MX Goemans","year":"1995","unstructured":"Goemans MX (1995) Worst-case comparison of valid inequalities for the TSP. Math Program 69: 335\u2013349","journal-title":"Math Program"},{"key":"198_CR51","first-page":"269","volume-title":"Recent advances in mathematical programming","author":"RE Gomory","year":"1963","unstructured":"Gomory RE (1963) An algorithm for integer solutions to linear programs. In: Graves RL, Wolfe P (eds) Recent advances in mathematical programming. McGraw-Hill, New York, pp 269\u2013302"},{"key":"198_CR52","doi-asserted-by":"crossref","unstructured":"Gomory RE (1965) On the relation between integer and non-integer solutions to linear programs. In: Proceedings of the National Academy of Sciences, vol 53, pp 260\u2013265","DOI":"10.1073\/pnas.53.2.260"},{"key":"198_CR53","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory RE (1969) Some polyhedra related to combinatorial problems. Linear Algebra Appl 2: 451\u2013558","journal-title":"Linear Algebra Appl"},{"key":"198_CR54","unstructured":"J\u00f6rg M (2008) k-disjunctive cuts and cutting plane algorithms for general mixed integer linear programs. Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen"},{"key":"198_CR55","unstructured":"Khachiyan LG (1979) A polynomial algorithm in linear programming (in russian). Doklady Akademii Nauk SSSR 244:1093\u20131096 (English translation: Soviet Mathematics Doklady 20:191\u2013194)"},{"key":"198_CR56","doi-asserted-by":"crossref","unstructured":"Khachiyan LG (1980) Polynomial algorithms in linear programming (in russian). Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki 20:51\u201368. (English translation: U.S.S.R. Computational Mathematics and Mathematical Physics 20:53\u201372)","DOI":"10.1016\/0041-5553(80)90061-0"},{"key":"198_CR57","first-page":"177","volume-title":"Mathematical programming: recent developments and applications","author":"L Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz L (1989) Geometry of numbers and integer programming. In: Iri M, Tanabe K (eds) Mathematical programming: recent developments and applications. Kluwer, Dordrecht, pp 177\u2013201"},{"key":"198_CR58","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H Marchand","year":"2001","unstructured":"Marchand H, Wolsey LA (2001) Aggregation and mixed integer rounding to solve MIPs. Oper Res 49: 363\u2013371","journal-title":"Oper Res"},{"key":"198_CR59","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"RR Meyer","year":"1974","unstructured":"Meyer RR (1974) On the existence of optimal solutions to integer and mixed-integer programming problems. Math Program 7: 223\u2013235","journal-title":"Math Program"},{"key":"198_CR60","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/100796947","volume":"25","author":"R Mor\u00e1n","year":"2011","unstructured":"Mor\u00e1n R, Dey SS (2011) On maximal S-free convex sets. SIAM J Discret Math 25: 379\u2013393","journal-title":"SIAM J Discret Math"},{"key":"198_CR61","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser GL, Wolsey LA (1990) A recursive procedure to generate all cuts for 0-1 mixed integer programs. Math Program 46: 379\u2013390","journal-title":"Math Program"},{"key":"198_CR62","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/moor.1110.0503","volume":"36","author":"B Nill","year":"2011","unstructured":"Nill B, Ziegler GM (2011) Projecting lattice polytopes without interior lattice points. Math Oper Res 36: 462\u2013467","journal-title":"Math Oper Res"},{"key":"198_CR63","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/PL00011407","volume":"89","author":"JH Owen","year":"2001","unstructured":"Owen JH, Mehrotra S. (2001) A disjunctive cutting plane procedure for general mixed integer linear programs. Math Program A 89: 437\u2013448","journal-title":"Math Program A"},{"key":"198_CR64","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton"},{"key":"198_CR65","first-page":"18","volume":"21","author":"G Salinetti","year":"1979","unstructured":"Salinetti G, Wets RJ-B (1979) On the convergence of sequences of convex sets in finite dimensions. Soc Ind Appl Math 21: 18\u201333","journal-title":"Soc Ind Appl Math"},{"key":"198_CR66","doi-asserted-by":"crossref","first-page":"3637","DOI":"10.1073\/pnas.74.9.3637","volume":"74","author":"HE Scarf","year":"1977","unstructured":"Scarf HE (1977) An observation on the structure of production sets with indivisiblities. Proc Natl Acad Sci USA 74: 3637\u20133641","journal-title":"Proc Natl Acad Sci USA"},{"key":"198_CR67","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","volume":"9","author":"A Schrijver","year":"1980","unstructured":"Schrijver A (1980) On cutting planes. Ann Discret Math 9: 291\u2013296","journal-title":"Ann Discret Math"},{"key":"198_CR68","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of Linear and Integer Programming. Wiley, Chichester"},{"key":"198_CR69","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.orl.2005.12.005","volume":"35","author":"JP Vielma","year":"2007","unstructured":"Vielma JP (2007) A constructive characterization of the split closure of a mixed integer linear program. Oper Res Lett 35: 29\u201335","journal-title":"Oper Res Lett"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0198-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-012-0198-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0198-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T17:40:27Z","timestamp":1561311627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-012-0198-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,15]]},"references-count":69,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["198"],"URL":"https:\/\/doi.org\/10.1007\/s10288-012-0198-8","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,15]]}}}