{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:01Z","timestamp":1759847641610,"version":"3.40.3"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319686394"},{"type":"electronic","value":"9783319686400"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68640-0_10","type":"book-chapter","created":{"date-parts":[[2017,12,6]],"date-time":"2017-12-06T11:54:19Z","timestamp":1512561259000},"page":"217-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The Maximum Edge Weight Clique Problem: Formulations and Solution Approaches"],"prefix":"10.1007","author":[{"given":"Seyedmohammadhossein","family":"Hosseinian","sequence":"first","affiliation":[]},{"given":"Dalila B. M. M.","family":"Fontes","sequence":"additional","affiliation":[]},{"given":"Sergiy","family":"Butenko","sequence":"additional","affiliation":[]},{"given":"Marco Buongiorno","family":"Nardelli","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Fornari","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Curtarolo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,7]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Agapito, L.A., Ferretti, A., Calzolari, A., Curtarolo, S., Buongiorno Nardelli, M.: Effective and accurate representation of extended Bloch states on finite Hilbert spaces. Phys. Rev. B 88, 165127 (2013)","key":"10_CR1","DOI":"10.1103\/PhysRevB.88.165127"},{"doi-asserted-by":"crossref","unstructured":"Agapito, L.A., Fornari, M., Ceresoli, D., Ferretti, A., Curtarolo, S., Buongiorno Nardelli, M.: Accurate tight-binding Hamiltonians for two-dimensional and layered materials. Phys. Rev. B 93, 125137 (2016)","key":"10_CR2","DOI":"10.1103\/PhysRevB.93.125137"},{"doi-asserted-by":"crossref","unstructured":"Agapito, L.A., Ismail-Beigi, S., Curtarolo, S., Fornari, M., Buongiorno Nardelli, M.: Accurate tight-binding Hamiltonian matrices from ab initio calculations: minimal basis sets. Phys. Rev. B 93, 035104 (2016)","key":"10_CR3","DOI":"10.1103\/PhysRevB.93.035104"},{"doi-asserted-by":"crossref","unstructured":"Alidaee, B., Glover, F., Kochenberger, G.A., Rego, C.: A new modeling and solution approach for the number partitioning problem. Adv. Decis. Sci. 2005(2), 113\u2013121 (2005)","key":"10_CR4","DOI":"10.1155\/JAMDS.2005.113"},{"doi-asserted-by":"crossref","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(2), 592\u2013597 (2007)","key":"10_CR5","DOI":"10.1016\/j.ejor.2006.06.035"},{"doi-asserted-by":"crossref","unstructured":"Alidaee, B., Kochenberger, G., Lewis, K., Lewis, M., Wang, H.: A new approach for modeling and solving set packing problems. Eur. J. Oper. Res. 186(2), 504\u2013512 (2008)","key":"10_CR6","DOI":"10.1016\/j.ejor.2006.12.068"},{"doi-asserted-by":"crossref","unstructured":"Balas, E., Christofides, N.: A restricted Lagrangean approach to the traveling salesman problem. Math. Program. 21(1), 19\u201346 (1981)","key":"10_CR7","DOI":"10.1007\/BF01584228"},{"doi-asserted-by":"crossref","unstructured":"Balas, E., Yu, C.S.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054\u20131068 (1986)","key":"10_CR8","DOI":"10.1137\/0215075"},{"unstructured":"Ballard, D.H., Brown, C.M.: Computer Vision, 1982. Prenice-Hall, Englewood Cliffs, NJ (1982)","key":"10_CR9"},{"doi-asserted-by":"crossref","unstructured":"Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem 1. Algorithmica 29(4), 610\u2013637 (2001)","key":"10_CR10","DOI":"10.1007\/s004530010074"},{"doi-asserted-by":"crossref","unstructured":"Butenko, S., Wilhelm, W.E.: Clique-detection models in computational biochemistry and genomics. Eur. J. Oper. Res. 173(1), 1\u201317 (2006)","key":"10_CR11","DOI":"10.1016\/j.ejor.2005.05.026"},{"doi-asserted-by":"crossref","unstructured":"Cavique, L.: A scalable algorithm for the market basket analysis. J. Retail. Consum. Serv. 14(6), 400\u2013407 (2007)","key":"10_CR12","DOI":"10.1016\/j.jretconser.2007.02.003"},{"doi-asserted-by":"crossref","unstructured":"Corman, S.R., Kuhn, T., McPhee, R.D., Dooley, K.J.: Studying complex discursive systems. Hum. Commun. Res. 28(2), 157\u2013206 (2002)","key":"10_CR13","DOI":"10.1111\/j.1468-2958.2002.tb00802.x"},{"doi-asserted-by":"crossref","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)","key":"10_CR14","DOI":"10.1016\/0377-2217(93)90097-7"},{"doi-asserted-by":"crossref","unstructured":"Faigle, U., Garbe, R., Heerink, K., Spieker, B.: Lp-relaxations for the edge-weighted subclique problem. In: Operations Research \u201993, pp. 157\u2013160. Springer, Berlin (1994)","key":"10_CR15","DOI":"10.1007\/978-3-642-46955-8_41"},{"doi-asserted-by":"crossref","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","key":"10_CR16","DOI":"10.1007\/BF01096763"},{"doi-asserted-by":"crossref","unstructured":"Fontes, D.B.M.M., Gon\u00e7alves, J.F.: Heuristic solutions for general concave minimum cost network flow problems. Networks 50(1), 67\u201376 (2007)","key":"10_CR17","DOI":"10.1002\/net.20167"},{"doi-asserted-by":"crossref","unstructured":"Fontes, D.B.M.M., Gon\u00e7alves, J.F.: A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks. Optim. Lett. 7(6), 1303\u20131324 (2013)","key":"10_CR18","DOI":"10.1007\/s11590-012-0505-5"},{"unstructured":"Fontes, D.B.M.M., Gon\u00e7alves, J.F., Fontes, F.F.: A GA approach to the maximum edge weight clique problem. In: CECNet 2016 \u2013 6th International Conference on Electronics, Communications and Networks, Macau University of Science and Technology (2016)","key":"10_CR19"},{"doi-asserted-by":"crossref","unstructured":"Fontes, D.B.M.M., Gon\u00e7alves, J.F., Fontes, F.F.: An evolutionary approach to the maximum edge weight clique problem (2017, submitted)","key":"10_CR20","DOI":"10.2174\/2352096511666180214105643"},{"doi-asserted-by":"crossref","unstructured":"F\u00f6rster, J., Famili, I., Fu, P., Palsson, B.\u00d8., Nielsen, J.: Genome-scale reconstruction of the saccharomyces cerevisiae metabolic network. Genome Res. 13(2), 244\u2013253 (2003)","key":"10_CR21","DOI":"10.1101\/gr.234503"},{"doi-asserted-by":"crossref","unstructured":"Gendron, B., Hertz, A., St-Louis, P.: A sequential elimination algorithm for computing bounds on the clique number of a graph. Discret. Optim. 5(3), 615\u2013628 (2008)","key":"10_CR22","DOI":"10.1016\/j.disopt.2008.01.001"},{"doi-asserted-by":"crossref","unstructured":"Glover, F., Kochenberger, G., Alidaee, B., Amini, M.: Tabu search with critical event memory: an enhanced application for binary quadratic programs. In: Meta-Heuristics, pp. 93\u2013109. Springer, Berlin (1999)","key":"10_CR23","DOI":"10.1007\/978-1-4615-5775-3_7"},{"doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17(5), 487\u2013525 (2011)","key":"10_CR24","DOI":"10.1007\/s10732-010-9143-1"},{"doi-asserted-by":"crossref","unstructured":"Gouveia, L., Martins, P.: Solving the maximum edge-weight clique problem in sparse graphs with compact formulations. EURO J. Comput. Optim. 3(1), 1\u201330 (2015)","key":"10_CR25","DOI":"10.1007\/s13675-014-0028-1"},{"doi-asserted-by":"crossref","unstructured":"Gouveia, L., Moura, P.: Enhancing discretized formulations: the knapsack reformulation and the star reformulation. Top 20(1), 52\u201374 (2012)","key":"10_CR26","DOI":"10.1007\/s11750-011-0212-x"},{"unstructured":"Hosseinian, S., Fontes, D.B.M.M., Butenko, S.: A quadratic approach to the maximum edge weight clique problem. In: XIII Global Optimization Workshop (2016)","key":"10_CR27"},{"doi-asserted-by":"crossref","unstructured":"Hosseinian, S., Fontes, D.B.M.M., Butenko, S.: A nonconvex quadratic optimization approach to the maximum edge weight clique problem (2017, submitted)","key":"10_CR28","DOI":"10.1007\/s10898-018-0630-5"},{"doi-asserted-by":"crossref","unstructured":"Hunting, M., Faigle, U., Kern, W.: A Lagrangian relaxation approach to the edge-weighted clique problem. Eur. J. Oper. Res. 131(1), 119\u2013131 (2001)","key":"10_CR29","DOI":"10.1016\/S0377-2217(99)00449-X"},{"doi-asserted-by":"crossref","unstructured":"Johnson, E.L., Mehrotra, A., Nemhauser, G.L.: Min-cut clustering. Math. Program. 62(1\u20133), 133\u2013151 (1993)","key":"10_CR30","DOI":"10.1007\/BF01585164"},{"doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Springer, Berlin (1972)","key":"10_CR31","DOI":"10.1007\/978-1-4684-2001-2_9"},{"doi-asserted-by":"crossref","unstructured":"Kochenberger, G., Glover, F., Alidaee, B., Lewis, K.: Using the unconstrained quadratic program to model and solve max 2-sat problems. Int. J. Oper. Res. 1(1\u20132), 89\u2013100 (2005)","key":"10_CR32","DOI":"10.1504\/IJOR.2005.007435"},{"doi-asserted-by":"crossref","unstructured":"Kochenberger, G.A., Glover, F., Alidaee, B., Rego, C.: An unconstrained quadratic binary programming approach to the vertex coloring problem. Ann. Oper. Res. 139(1), 229\u2013241 (2005)","key":"10_CR33","DOI":"10.1007\/s10479-005-3449-7"},{"doi-asserted-by":"crossref","unstructured":"Lei, T.L., Church, R.L.: On the unified dispersion problem: efficient formulations and exact algorithms. Eur. J. Oper. Res. 241(3), 622\u2013630 (2015)","key":"10_CR34","DOI":"10.1016\/j.ejor.2014.10.020"},{"doi-asserted-by":"crossref","unstructured":"Li, X., Wu, M., Kwoh, C.K., Ng, S.K.: Computational approaches for detecting protein complexes from protein interaction networks: a survey. BMC Genomics 11(1), 1 (2010)","key":"10_CR35","DOI":"10.1186\/1471-2164-11-S1-S3"},{"unstructured":"Lucena, A.: Steiner problem in graphs: Lagrangean relaxation and cutting planes. COAL Bull. 21(2), 2\u20138 (1992)","key":"10_CR36"},{"doi-asserted-by":"crossref","unstructured":"Macambira, E.M.: An application of tabu search heuristic for the maximum edge-weighted subgraph problem. Ann. Oper. Res. 117, 175\u2013190 (2002)","key":"10_CR37","DOI":"10.1023\/A:1021525624027"},{"doi-asserted-by":"crossref","unstructured":"Macambira, E.M., de Souza, C.C.: The edge-weighted clique problem: valid inequalities, facets and polyhedral computations. Eur. J. Oper. Res. 123, 346\u2013371 (2000)","key":"10_CR38","DOI":"10.1016\/S0377-2217(99)00262-3"},{"doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A., Pardo, E.G.: Heuristics and metaheuristics for the maximum diversity problem. J. Heuristics 19(4), 591\u2013615 (2013)","key":"10_CR39","DOI":"10.1007\/s10732-011-9172-4"},{"doi-asserted-by":"crossref","unstructured":"Martins, P.: Extended and discretized formulations for the maximum clique problem. Comput. Oper. Res. 37(7), 1348\u20131358 (2010)","key":"10_CR40","DOI":"10.1016\/j.cor.2009.10.010"},{"doi-asserted-by":"crossref","unstructured":"Martins, P.: Cliques with maximum\/minimum edge neighborhood and neighborhood density. Comput. Oper. Res. 39(3), 594\u2013608 (2012)","key":"10_CR41","DOI":"10.1016\/j.cor.2011.04.016"},{"doi-asserted-by":"crossref","unstructured":"Mascia, F., Cilia, E., Brunato, M., Passerini, A.: Predicting structural and functional sites in proteins by searching for maximum-weight cliques. In: AAAI. Citeseer (2010)","key":"10_CR42","DOI":"10.1609\/aaai.v24i1.7495"},{"doi-asserted-by":"crossref","unstructured":"Mehrotra, A.: Cardinality constrained boolean quadratic polytope. Discret. Appl. Math. 79, 137\u2013154 (1997)","key":"10_CR43","DOI":"10.1016\/S0166-218X(97)00039-5"},{"doi-asserted-by":"crossref","unstructured":"Mehrotra, A., Trick, M.A.: Cliques and clustering: a combinatorial approach. Oper. Res. Lett. 22(1), 1\u201312 (1998)","key":"10_CR44","DOI":"10.1016\/S0167-6377(98)00006-6"},{"doi-asserted-by":"crossref","unstructured":"Padberg, M.: The boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45(1\u20133), 139\u2013172 (1989)","key":"10_CR45","DOI":"10.1007\/BF01589101"},{"doi-asserted-by":"crossref","unstructured":"Park, K., Lee, K., Park, S.: An extended formulation approach to the edge-weighted maximal clique problem. Eur. J. Oper. Res. 95(3), 671\u2013682 (1996)","key":"10_CR46","DOI":"10.1016\/0377-2217(95)00299-5"},{"doi-asserted-by":"crossref","unstructured":"Pisinger, D.: The quadratic knapsack problem \u2013 a survey. Discret Appl. Math. 155, 623\u2013648 (2007)","key":"10_CR47","DOI":"10.1016\/j.dam.2006.08.007"},{"doi-asserted-by":"crossref","unstructured":"Prokopyev, O.A., Kong, N., Martinez-Torres, D.L.: The equitable dispersion problem. Eur. J. Oper. Res. 197(1), 59\u201367 (2009)","key":"10_CR48","DOI":"10.1016\/j.ejor.2008.06.005"},{"doi-asserted-by":"crossref","unstructured":"Pullan, W.: Phased local search for the maximum clique problem. J. Comb. Optim. 12(3), 303\u2013323 (2006)","key":"10_CR49","DOI":"10.1007\/s10878-006-9635-y"},{"doi-asserted-by":"crossref","unstructured":"Pullan, W.: Approximating the maximum vertex\/edge weighted clique using local search. J. Heuristics 14(2), 117\u2013134 (2008)","key":"10_CR50","DOI":"10.1007\/s10732-007-9026-2"},{"unstructured":"S\u00f8rensen, M.M.: New facets and a branch-and-cut algorithm for the weighted clique problem. Working paper 01\u20132, Department of Management Science and Logistics, The Aarhus School of Business (2001)","key":"10_CR51"},{"doi-asserted-by":"crossref","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)","key":"10_CR52","DOI":"10.1016\/S0377-2217(02)00852-4"},{"doi-asserted-by":"crossref","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)","key":"10_CR53","DOI":"10.1007\/BF01918201"},{"doi-asserted-by":"crossref","unstructured":"Tomita, E., Akutsu, T., Matsunaga, T.: Efficient algorithms for finding maximum and maximal cliques: effective tools for bioinformatics. INTECH Open Access Publisher (2011)","key":"10_CR54","DOI":"10.5772\/13245"},{"issue":"3","key":"10_CR55","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":["Springer Optimization and Its Applications","Optimization Methods and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68640-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T18:28:17Z","timestamp":1693333697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68640-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319686394","9783319686400"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68640-0_10","relation":{},"ISSN":["1931-6828","1931-6836"],"issn-type":[{"type":"print","value":"1931-6828"},{"type":"electronic","value":"1931-6836"}],"subject":[],"published":{"date-parts":[[2017]]}}}