{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T03:55:05Z","timestamp":1777694105400,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,22]],"date-time":"2016-06-22T00:00:00Z","timestamp":1466553600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11590-016-1055-z","type":"journal-article","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T10:53:08Z","timestamp":1466679188000},"page":"47-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A new family of facet defining inequalities for the maximum edge-weighted clique problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Franklin Djeumou","family":"Fomeni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,22]]},"reference":[{"key":"1055_CR1","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2006.06.035","volume":"181","author":"B Alidaee","year":"2007","unstructured":"Alidaee, B., Glover, F., Kochenberger, G., Wang, H.: Solving the maximum edge weight clique problem via unconstrained quadratic programming. Eur. J. Oper. Res. 181, 592\u2013597 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"1055_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","volume":"11","author":"A Caprara","year":"1998","unstructured":"Caprara, A., Pisinger, D., Toth, P.: Exact solution of the quadratic knapsack problem. INFORMS J. Comput. 11, 125\u2013137 (1998)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1055_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(93)90097-7","volume":"69","author":"G Dijkhuizen","year":"1993","unstructured":"Dijkhuizen, G., Faigle, U.: A cutting-plane approach to the edge-weighted maximal clique problem. Eur. J. Oper. Res. 69(1), 121\u2013130 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1055_CR4","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1007\/s10107-015-0863-8","volume":"151","author":"F Djeumou Fomeni","year":"2015","unstructured":"Djeumou Fomeni, F., Kaparis, K., Letchford, A.N.: Cutting planes for first-level RLT relaxations of mixed 0\u20131 programs. Math. Progr. 151(2), 639\u2013658 (2015)","journal-title":"Math. Progr."},{"issue":"1","key":"1055_CR5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.2013.0555","volume":"26","author":"F Djeumou Fomeni","year":"2014","unstructured":"Djeumou Fomeni, F., Letchford, A.N.: A dynamic programming heuristic for the quadratic knapsack problem. INFORMS J. Comp. 26(1), 173\u2013183 (2014)","journal-title":"INFORMS J. Comp."},{"key":"1055_CR6","unstructured":"Hunting, M.: Relaxation techniques for discrete optimization problems: theory and algorithms. PhD thesis, University of Twente (1998)"},{"key":"1055_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0377-2217(99)00449-X","volume":"131","author":"M Hunting","year":"2001","unstructured":"Hunting, M., Faigle, U., Kern, W.: A Lagrangean relaxation approach to the edge-weighted clique problem. Eur. J. Oper. Res. 131, 119\u2013131 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"1055_CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1009898604624","volume":"4","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F., Weismantel, R.: A semidefinite programming approach to the quadratic knapsack problem. J. Comb. Optim. 4, 197\u2013215 (2000)","journal-title":"J. Comb. Optim."},{"key":"1055_CR9","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. Progr. 62, 133\u2013151 (1993)","journal-title":"Math. Progr."},{"key":"1055_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","volume":"9","author":"MJ Kuby","year":"1987","unstructured":"Kuby, M.J.: Programming models for facility dispersion: the $$p$$ p -dispersion and maxisum dispersion problem. Geograph. Anal. 9, 315\u2013329 (1987)","journal-title":"Geograph. Anal."},{"key":"1055_CR11","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/S0377-2217(99)00262-3","volume":"123","author":"EM Macambria","year":"2000","unstructured":"Macambria, E.M., de Souza, C.C.: The edge-weight clique problem: valid inequalities, facets and polyhedral computations. Eur. J. Oper. Res. 123, 346\u2013371 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"1055_CR12","first-page":"146","volume":"10","author":"GP McCormick","year":"1979","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I-convex underestimating problems. Math. Progr. 10, 146\u2013175 (1979)","journal-title":"Math. Progr."},{"key":"1055_CR13","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. Disc. Appl. Math 79, 137\u2013154 (1997)","journal-title":"Disc. Appl. Math"},{"key":"1055_CR14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/0377-2217(95)00299-5","volume":"95","author":"K Park","year":"1995","unstructured":"Park, K., Lee, K., Park, S.: An extended formulation approach to the edge-weight maximal clique problem. Eur. J. Oper. Res. 95, 671\u2013682 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"1055_CR15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"MW Padberg","year":"1989","unstructured":"Padberg, M.W.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Progr. 45, 139\u2013172 (1989)","journal-title":"Math. Progr."},{"key":"1055_CR16","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: a survey. Discr. Appl. Math. 155, 623\u2013648 (2007)","journal-title":"Discr. Appl. Math."},{"issue":"2","key":"1055_CR17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/opre.42.2.299","volume":"42","author":"SS Ravi","year":"1994","unstructured":"Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Oper. Res. 42(2), 299\u2013310 (1994)","journal-title":"Oper. Res."},{"issue":"3","key":"1055_CR18","first-page":"125","volume":"29","author":"H Sp\u00e4th","year":"1985","unstructured":"Sp\u00e4th, H.: Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs. Z. Oper. Res. 29(3), 125\u2013131 (1985)","journal-title":"Z. Oper. Res."},{"key":"1055_CR19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0377-2217(02)00852-4","volume":"154","author":"MM S\u00f8rensen","year":"2004","unstructured":"S\u00f8rensen, M.M.: New facets and a branch-and-cut algorithm for the weighted clique problem. Eur. J. Oper. Res. 154, 57\u201370 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1055_CR20","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3), 693\u2013709 (2015)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1055-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1055-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1055-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1055-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T20:43:51Z","timestamp":1718657031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1055-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,22]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1055"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1055-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,22]]}}}