{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T05:27:43Z","timestamp":1769059663859,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T00:00:00Z","timestamp":1520380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T00:00:00Z","timestamp":1520380800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Foundation","award":["CMMI-1538493"],"award-info":[{"award-number":["CMMI-1538493"]}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["N00014-13-1-0635"],"award-info":[{"award-number":["N00014-13-1-0635"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BSAB\/113662\/2015"],"award-info":[{"award-number":["SFRH\/BSAB\/113662\/2015"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10898-018-0630-5","type":"journal-article","created":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T04:28:22Z","timestamp":1520396902000},"page":"219-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A nonconvex quadratic optimization approach to the maximum edge weight clique problem"],"prefix":"10.1007","volume":"72","author":[{"given":"Seyedmohammadhossein","family":"Hosseinian","sequence":"first","affiliation":[]},{"given":"Dalila B.\u00a0M.\u00a0M.","family":"Fontes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6662-9552","authenticated-orcid":false,"given":"Sergiy","family":"Butenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,7]]},"reference":[{"key":"630_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1011968411281","volume":"21","author":"J Abello","year":"2001","unstructured":"Abello, J., Butenko, S., Pardalos, P., Resende, M.: Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. 21, 111\u2013137 (2001)","journal-title":"J. Glob. Optim."},{"key":"630_CR2","doi-asserted-by":"crossref","unstructured":"Akutsu, T., Hayashida, M., Tomita, E., Suzuki, J.: Protein threading with profiles and constraints. In: Proceedings of the Fourth IEEE Symposium on Bioinformatics and Bioengineering, pp. 537\u2013544 (2004 May)","DOI":"10.1109\/BIBE.2004.1317389"},{"issue":"2","key":"630_CR3","doi-asserted-by":"publisher","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(2), 592\u2013597 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"630_CR4","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1057\/jors.2010.104","volume":"62","author":"R Aringhieri","year":"2011","unstructured":"Aringhieri, R., Cordone, R.: Comparing local search metaheuristics for the maximum diversity problem. J. Oper. Res. Soc. 62(2), 266\u2013280 (2011)","journal-title":"J. Oper. Res. Soc."},{"key":"630_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10898-005-5185-6","volume":"35","author":"B Balasundaram","year":"2006","unstructured":"Balasundaram, B., Butenko, S.: On a polynomial fractional formulation for independence number of a graph. J. Glob. Optim. 35, 405\u2013421 (2006)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"630_CR6","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10878-012-9592-6","volume":"27","author":"M Batsyn","year":"2014","unstructured":"Batsyn, M., Goldengorin, B., Maslov, E., Pardalos, P.M.: Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27(2), 397\u2013416 (2014)","journal-title":"J. Comb. Optim."},{"key":"630_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"IM Bomze","year":"1997","unstructured":"Bomze, I.M.: Evolution towards the maximum clique. J. Glob. Optim. 10, 143\u2013164 (1997)","journal-title":"J. Glob. Optim."},{"key":"630_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-1-4757-3145-3_6","volume-title":"Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems","author":"IM Bomze","year":"2000","unstructured":"Bomze, I.M., Budinich, M., Pelillo, M., Rossi, C.: A new \u201cannealed\u201d heuristic for the maximum clique problem. In: Pardalos, P.M. (ed.) Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, pp. 78\u201396. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"630_CR9","first-page":"3","volume":"17","author":"JB Brown","year":"2006","unstructured":"Brown, J.B., Bahadur, D.K.C., Tomita, E., Akutsu, T.: Multiple methods for protein side chain packing using maximum weight cliques. Genome Inform. 17, 3\u201312 (2006)","journal-title":"Genome Inform."},{"issue":"2","key":"630_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11590-008-0108-3","volume":"3","author":"SR Bul\u00f2","year":"2009","unstructured":"Bul\u00f2, S.R., Pelillo, M.: A generalization of the Motzkin\u2013Straus theorem to hypergraphs. Optim. Lett. 3(2), 287\u2013295 (2009)","journal-title":"Optim. Lett."},{"key":"630_CR11","doi-asserted-by":"publisher","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","volume":"154","author":"S Busygin","year":"2006","unstructured":"Busygin, S.: A new trust region technique for the maximum weight clique problem. Discrete Appl. Math. 154, 2080\u20132096 (2006)","journal-title":"Discrete Appl. Math."},{"key":"630_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1014899909753","volume":"6","author":"S Busygin","year":"2002","unstructured":"Busygin, S., Butenko, S., Pardalos, P.M.: A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere. J. Comb. Optim. 6, 287\u2013297 (2002)","journal-title":"J. Comb. Optim."},{"key":"630_CR13","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, P.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9, 375\u2013382 (1990)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"630_CR14","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.jretconser.2007.02.003","volume":"14","author":"L Cavique","year":"2007","unstructured":"Cavique, L.: A scalable algorithm for the market basket analysis. J. Retail. Consum. Serv. 14(6), 400\u2013407 (2007)","journal-title":"J. Retail. Consum. Serv."},{"key":"630_CR15","unstructured":"de Andrade, M.R.Q., de Andrade, P.M.F., Martins, S.L., Plastino, A.: Grasp with path-relinking for the maximum diversity problem. In: Nikoletseas, S.E. (ed.) Proceedings of the Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10\u201313, 2005, pp. 558\u2013569. Springer, Berlin (2005)"},{"issue":"1","key":"630_CR16","doi-asserted-by":"publisher","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":"4","key":"630_CR17","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1137\/0113073","volume":"13","author":"GE Forsythe","year":"1965","unstructured":"Forsythe, G.E., Golub, G.H.: On the stationary values of a second-degree polynomial on the unit sphere. J. Soc. Ind. Appl. Math. 13(4), 1050\u20131068 (1965)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"3","key":"630_CR18","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10589-007-9161-6","volume":"44","author":"M Gallego","year":"2009","unstructured":"Gallego, M., Duarte, A., Laguna, Manuel, Mart\u00ed, Rafael: Hybrid heuristics for the maximum diversity problem. Comput. Optim. Appl. 44(3), 411\u2013426 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"630_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1090\/dimacs\/026\/07","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"LE Gibbons","year":"1996","unstructured":"Gibbons, L.E., Hearn, D.W., Pardalos, P.M.: A continuous based heuristic for the maximum clique problem. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: Second DIMACS Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 103\u2013124. American Mathematical Society, Providence (1996)"},{"key":"630_CR20","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"LE Gibbons","year":"1997","unstructured":"Gibbons, L.E., Hearn, D.W., Pardalos, P.M., Ramana, M.V.: Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22, 754\u2013768 (1997)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"630_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13675-014-0028-1","volume":"3","author":"L Gouveia","year":"2015","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)","journal-title":"EURO J. Comput. Optim."},{"key":"630_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0012-365X(98)00048-X","volume":"188","author":"J Harant","year":"1998","unstructured":"Harant, J.: A lower bound on the independence number of a graph. Discrete Math. 188, 239\u2013243 (1998)","journal-title":"Discrete Math."},{"key":"630_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.7151\/dmgt.1107","volume":"20","author":"J Harant","year":"2000","unstructured":"Harant, J.: Some news about the independence number of a graph. Discuss. Mathe. Graph Theory 20, 71\u201379 (2000)","journal-title":"Discuss. Mathe. Graph Theory"},{"key":"630_CR24","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1017\/S0963548399004034","volume":"8","author":"J Harant","year":"1999","unstructured":"Harant, J., Pruchnewski, A., Voigt, M.: On dominating sets and independent sets of graphs. Comb. Probab. Comput. 8, 547\u2013553 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"630_CR25","first-page":"125","volume-title":"XIII Global Optimization Workshop (GOW\u201916)","author":"S Hosseinian","year":"2016","unstructured":"Hosseinian, S., Fontes, D.B.M.M., Butenko, S.: A quadratic approach to the maximum edge weight clique problem. In: Rocha, A.M.A.C., Costa, M.F.P., Fernandes, E.M.G.P. (eds.) XIII Global Optimization Workshop (GOW\u201916), pp. 125\u2013128. University of Minho, Braga (2016)"},{"key":"630_CR26","doi-asserted-by":"crossref","unstructured":"Hosseinian, S., Fontes, D.B.M.M., Butenko, S., Buongiorno Nardelli, M., Fornari, M., Curtarolo, S.: The maximum edge weight clique problem: formulations and solution approaches. In: Butenko, S., Pardalos, P\u00a0.M., Shylo, V. (eds.) Optimization Methods and Applications, pp. 217\u2013237. Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-68640-0_10"},{"issue":"1","key":"630_CR27","doi-asserted-by":"publisher","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 Lagrangian relaxation approach to the edge-weighted clique problem. Eur. J. Oper. Res. 131(1), 119\u2013131 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"630_CR28","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-1-4614-3363-7_54","volume-title":"Proceedings of the Third International Conference on Trends in Information, Telecommunication and Computing","author":"MA Jabbar","year":"2013","unstructured":"Jabbar, M.A., Deekshatulu, B\u00a0.L., Chandra, P.: Graph based approach for heart disease prediction. In: Das, Vinu\u00a0V (ed.) Proceedings of the Third International Conference on Trends in Information, Telecommunication and Computing, pp. 465\u2013474. Springer, New York (2013)"},{"key":"630_CR29","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"630_CR30","doi-asserted-by":"crossref","unstructured":"Ma, T., Latecki, L.J.: Maximum weight cliques with mutex constraints for video object segmentation. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 670\u2013677 (2012 June)","DOI":"10.1109\/CVPR.2012.6247735"},{"issue":"2","key":"630_CR31","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/S0377-2217(99)00262-3","volume":"123","author":"EM Macambira","year":"2000","unstructured":"Macambira, E.M., de Souza, C.C.: The edge-weighted clique problem: valid inequalities, facets and polyhedral computations. Eur. J. Oper. Res. 123(2), 346\u2013371 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"630_CR32","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10732-011-9172-4","volume":"19","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A., Pardo, E.G.: Heuristics and metaheuristics for the maximum diversity problem. J. Heur. 19(4), 591\u2013615 (2013)","journal-title":"J. Heur."},{"key":"630_CR33","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J Math. 17, 533\u2013540 (1965)","journal-title":"Can. J Math."},{"key":"630_CR34","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120, 197\u2013207 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"630_CR35","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.amc.2006.11.090","volume":"189","author":"G Palubeckis","year":"2007","unstructured":"Palubeckis, G.: Iterated tabu search for the maximum diversity problem. Applied Math. Comput. 189(1), 371\u2013383 (2007)","journal-title":"Applied Math. Comput."},{"issue":"1","key":"630_CR36","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Global Optim. 1(1), 15\u201322 (1991)","journal-title":"J. Global Optim."},{"key":"630_CR37","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/00207169008803851","volume":"33","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Phillips, A.T.: A global optimization approach for solving the maximum clique problem. Int. J. Comput. Math. 33, 209\u2013216 (1990)","journal-title":"Int. J. Comput. Math."},{"issue":"3","key":"630_CR38","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/0377-2217(95)00299-5","volume":"95","author":"K Park","year":"1996","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)","journal-title":"Eur. J. Oper. Res."},{"key":"630_CR39","unstructured":"Pavan, M., Pelillo, M.: Generalizing the motzkin-straus theorem to edge-weighted graphs, with applications to image segmentation. In: Rangarajan, Anand, Figueiredo, M\u00e1rio, Zerubia, Josiane (eds.) Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition: 4th International Workshop, EMMCVPR 2003, Lisbon, Portugal, July 7\u20139, 2003, pp. 485\u2013500. Springer, Berlin (2003)"},{"key":"630_CR40","first-page":"411","volume":"2","author":"M Pelillo","year":"1995","unstructured":"Pelillo, M., Jagota, A.: Feasible and infeasible maxima in a quadratic program for maximum clique. J. Artif. Neural Netw. 2, 411\u2013420 (1995)","journal-title":"J. Artif. Neural Netw."},{"key":"630_CR41","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.dam.2015.06.037","volume":"200","author":"Y Peng","year":"2016","unstructured":"Peng, Y., Peng, H., Tang, Q., Zhao, C.: An extension of the Motzkin\u2013Straus theorem to non-uniform hypergraphs and its applications. Discrete Appl. Math. 200, 170\u2013175 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"630_CR42","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10732-007-9026-2","volume":"14","author":"W Pullan","year":"2008","unstructured":"Pullan, W.: Approximating the maximum vertex\/edge weighted clique using local search. J. Heur. 14(2), 117\u2013134 (2008)","journal-title":"J. Heur."},{"key":"630_CR43","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.cor.2015.06.009","volume":"64","author":"P San Segundo","year":"2015","unstructured":"Segundo, P.San, Nikolaev, A., Batsyn, M., Batsyn, M.: Infra-chromatic bound for exact maximum clique search. Comput. Oper. Res. 64, 293\u2013303 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"630_CR44","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10732-007-9010-x","volume":"13","author":"GC Silva","year":"2007","unstructured":"Silva, G.C., de Andrade, M.R.Q., Ochi, L.S., Martins, S.L., Plastino, A.: New heuristics for the maximum diversity problem. J. Heur. 13(4), 315\u2013336 (2007)","journal-title":"J. Heur."},{"issue":"1","key":"630_CR45","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0377-2217(02)00852-4","volume":"154","author":"MM Sorensen","year":"2004","unstructured":"Sorensen, M.M.: New facets and a branch-and-cut algorithm for the weighted clique problem. Eur. J. Oper. Res. 154(1), 57\u201370 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"630_CR46","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Global Optim. 37(1), 95\u2013111 (2007)","journal-title":"J. Global Optim."},{"key":"630_CR47","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique. In: Rahman, Md.\u00a0Saidur, Fujita, Satoshi (eds), Proceedings of the WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10\u201312, 2010, pp. 191\u2013203. Springer, Berlin (2010)"},{"key":"630_CR48","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.engappai.2013.09.005","volume":"27","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Hao, J.K., Glover, F., L\u00fc, Z.: A tabu search based memetic algorithm for the maximum diversity problem. Eng. Appl. Artif. Intell. 27, 103\u2013114 (2014)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"630_CR49","doi-asserted-by":"publisher","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."},{"key":"630_CR50","first-page":"19","volume-title":"Recent Advances in Global Optimization","author":"Y Ye","year":"1992","unstructured":"Ye, Y.: A new complexity result on minimization of a quadratic function with a sphere constraint. In: Floudas, C., Pardalos, P. (eds.) Recent Advances in Global Optimization, pp. 19\u201331. Princeton University Press, Princeton (1992)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0630-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0630-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0630-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T12:43:59Z","timestamp":1751460239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0630-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,7]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["630"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0630-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,7]]},"assertion":[{"value":"27 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}