{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T05:38:38Z","timestamp":1779255518441,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T00:00:00Z","timestamp":1548633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Italian Ministry of Education and Research","award":["20153TXRX9"],"award-info":[{"award-number":["20153TXRX9"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s00500-019-03769-y","type":"journal-article","created":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T09:18:48Z","timestamp":1548667128000},"page":"3013-3027","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Computational study of separation algorithms for clique inequalities"],"prefix":"10.1007","volume":"23","author":[{"given":"Francesca","family":"Marzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7495-390X","authenticated-orcid":false,"given":"Fabrizio","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8152-003X","authenticated-orcid":false,"given":"Stefano","family":"Smriglio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,28]]},"reference":[{"issue":"1","key":"3769_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk A, Nemhauser GL, Savelsbergh MWP (2000) Conflict graphs in solving integer programming problems. Eur J Oper Res 121(1):40\u201355","journal-title":"Eur J Oper Res"},{"issue":"4","key":"3769_CR2","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1287\/trsc.2017.0750","volume":"51","author":"P Avella","year":"2017","unstructured":"Avella P, Boccia M, Mannino C, Vasilyev I (2017) Time-indexed formulations for the runway scheduling problem. Transp Sci 51(4):1196\u20131209","journal-title":"Transp Sci"},{"key":"3769_CR3","doi-asserted-by":"crossref","unstructured":"Balas E, Padberg MW (1976) Set partitioning: a survey. Management sciences research report, Graduate School of Industrial Administration, Carnegie-Mellon University","DOI":"10.1137\/1018115"},{"key":"3769_CR4","unstructured":"Bornd\u00f6rfer R (1998) Aspects of set packing, partitioning, and covering. Ph. D. thesis, TU Berlin"},{"key":"3769_CR5","unstructured":"Bornd\u00f6rfer R, Kormos Z (1997) An algorithm for maximum cliques. Unpublished working paper, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik"},{"issue":"3","key":"3769_CR6","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/PL00011381","volume":"88","author":"R Bornd\u00f6rfer","year":"2000","unstructured":"Bornd\u00f6rfer R, Weismantel R (2000) Set packing relaxations of some inte]ger programs. Math Program 88(3):425\u2013450","journal-title":"Math Program"},{"issue":"2","key":"3769_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0166-218X(99)00050-5","volume":"92","author":"A Caprara","year":"1999","unstructured":"Caprara A, Salazar Gonz\u00e1lez JJ (1999) Separating lifted odd-hole inequalities to solve the index selection problem. Discret Appl Math 92(2):111\u2013134","journal-title":"Discret Appl Math"},{"issue":"6","key":"3769_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9(6):375\u2013382","journal-title":"Oper Res Lett"},{"key":"3769_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.dam.2017.02.005","volume":"245","author":"RC Corr\u00eaa","year":"2017","unstructured":"Corr\u00eaa RC, Delle Donne D, Koch I, Marenco J (2017) General cut-generating procedures for the stable set polytope. Discret Appl Math 245:28\u201341","journal-title":"Discret Appl Math"},{"key":"3769_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-66158-2_7","volume-title":"Principles and practice of constraint programming","author":"S Givry de","year":"2017","unstructured":"de Givry S, Katsirelos G (2017) Clique cuts in weighted constraint satisfaction. In: Beck JC (ed) Principles and practice of constraint programming. Springer International Publishing, Cham, pp 97\u2013113"},{"issue":"3","key":"3769_CR11","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.dss.2008.10.009","volume":"46","author":"LF Escudero","year":"2009","unstructured":"Escudero LF, Landete M, Mar\u00edn A (2009) A branch-and-cut algorithm for the winner determination problem. Decis Support Syst 46(3):649\u2013659","journal-title":"Decis Support Syst"},{"issue":"4","key":"3769_CR12","first-page":"185","volume":"52","author":"M Groiez","year":"2014","unstructured":"Groiez M, Desaulniers G, Marcotte O (2014) Valid inequalities and separation algorithms for the set partitioning problem. INFOR: Inf Syst Oper Res 52(4):185\u2013196","journal-title":"INFOR: Inf Syst Oper Res"},{"key":"3769_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, Berlin"},{"issue":"2","key":"3769_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2):169\u2013197","journal-title":"Combinatorica"},{"issue":"1","key":"3769_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J (1999) Clique is hard to approximate within \n                    \n                      \n                    \n                    $$n^{(1-\\epsilon )}$$\n                    \n                      \n                        \n                          n\n                          \n                            (\n                            1\n                            -\n                            \u03f5\n                            )\n                          \n                        \n                      \n                    \n                  . Acta Math 182(1):105\u2013142","journal-title":"Acta Math"},{"issue":"6","key":"3769_CR16","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K Hoffman","year":"1993","unstructured":"Hoffman K, Padberg M (1993) Solving airline crew scheduling problems by branch-and-cut. Manag Sci 39(6):657\u2013682","journal-title":"Manag Sci"},{"key":"3769_CR17","unstructured":"Intel distribution for Python (2018) \n                    https:\/\/software.intel.com\/en-us\/distribution-for-python"},{"key":"3769_CR18","unstructured":"Johnson DJ, Trick MA (eds) (1996) Cliques, coloring, and satisfiability: second DIMACS implementation challenge, Workshop, October 11\u201313, 1993. American Mathematical Society, Boston, MA"},{"key":"3769_CR19","unstructured":"Letchford AN, Rossi F, Smriglio S (2018) The stable set problem: clique and nodal inequalities revisited. Optimization Online, \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2018\/05\/6612.html"},{"issue":"5","key":"3769_CR20","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1057\/jors.1992.71","volume":"43","author":"GL Nemhauser","year":"1992","unstructured":"Nemhauser GL, Sigismondi G (1992) A strong cutting plane\/branch-and-bound algorithm for node packing. J Oper Res Soc 43(5):443\u2013457","journal-title":"J Oper Res Soc"},{"key":"3769_CR21","unstructured":"Niskanen S, \u00d6sterg\u00e5rd PRJ (2002) Routines for clique searching. \n                    http:\/\/users.aalto.fi\/~pat\/cliquer.html"},{"issue":"1","key":"3769_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"MW Padberg","year":"1973","unstructured":"Padberg MW (1973) On the facial structure of set packing polyhedra. Math Program 5(1):199\u2013215","journal-title":"Math Program"},{"key":"3769_CR23","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-1-4613-3279-4_18","volume-title":"High performance algorithms and software in nonlinear optimization","author":"P Pardalos","year":"1998","unstructured":"Pardalos P, Rappe J, Resende MGC (1998) An exact parallel algorithm for the maximum clique problem. In: De Leone R et al (eds) High performance algorithms and software in nonlinear optimization. Springer, Boston, pp 279\u2013300"},{"issue":"2","key":"3769_CR24","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/S0377-2217(00)00064-3","volume":"131","author":"F Rossi","year":"2001","unstructured":"Rossi F, Smriglio S (2001) A set packing model for the ground holding problem in congested networks. Eur J Oper Res 131(2):400\u2013416","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3769_CR25","first-page":"53","volume":"48","author":"S Spoorendonk","year":"2010","unstructured":"Spoorendonk S, Desaulniers G (2010) Clique inequalities applied to the vehicle routing problem with time windows. INFOR J 48(1):53\u201367","journal-title":"INFOR J"},{"key":"3769_CR26","unstructured":"SCIP Optimization Suite (2018). \n                    http:\/\/scip.zib.de\/"},{"issue":"3","key":"3769_CR27","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-002-0335-9","volume":"93","author":"H Waterer","year":"2002","unstructured":"Waterer H, Johnson EL, Nobili P, Savelsbergh MWP (2002) The relation of time indexed formulations of single machine scheduling problems to the node packing problem. Math Program 93(3):477\u2013494","journal-title":"Math Program"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-03769-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03769-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03769-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T19:04:29Z","timestamp":1580151869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-03769-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,28]]},"references-count":27,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["3769"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-03769-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,28]]},"assertion":[{"value":"28 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors declare that they have no conflict of interest","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}