{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:16:04Z","timestamp":1774419364852,"version":"3.50.1"},"reference-count":37,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Info. Tech. Dec. Mak."],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:p> Finding good solutions to clique partitioning problems remains a computational challenge. With rare exceptions, finding optimal solutions for all but small instances is not practically possible. However, choosing the most appropriate modeling structure can have a huge impact on what is practical to obtain from exact solvers within a reasonable amount of run time. Commercial solvers have improved tremendously in recent years and the combination of the right solver and the right model can significantly increase our ability to compute acceptable solutions to modest-sized problems with solvers like CPLEX, GUROBI and XPRESS. In this paper, we explore and compare the use of three commercial solvers on modest sized test problems for clique partitioning. For each problem instance, a conventional linear model from the literature and a relatively new quadratic model are compared. Extensive computational experience indicates that the quadratic model outperforms the classic linear model as problem size grows. <\/jats:p>","DOI":"10.1142\/s0219622021500504","type":"journal-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T04:42:32Z","timestamp":1628656952000},"page":"59-81","source":"Crossref","is-referenced-by-count":15,"title":["Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers"],"prefix":"10.1142","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6286-4814","authenticated-orcid":false,"given":"Yu","family":"Du","sequence":"first","affiliation":[{"name":"University of Colorado at Denver, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary","family":"Kochenberger","sequence":"additional","affiliation":[{"name":"University of Colorado at Denver, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[{"name":"University of Colorado at Boulder, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibo","family":"Wang","sequence":"additional","affiliation":[{"name":"Texas A&M International University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Lewis","sequence":"additional","affiliation":[{"name":"Missouri State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weihong","family":"Xie","sequence":"additional","affiliation":[{"name":"Guangdong University of Technology, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tsuyuguchi","sequence":"additional","affiliation":[{"name":"Texas A&M International University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"S0219622021500504BIB001","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"S0219622021500504BIB002","doi-asserted-by":"publisher","DOI":"10.1145\/127601.127682"},{"key":"S0219622021500504BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200205"},{"key":"S0219622021500504BIB004","first-page":"116","volume":"2","author":"Kral J.","year":"1965","journal-title":"Information Processing Machines"},{"key":"S0219622021500504BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10696-006-9011-3"},{"key":"S0219622021500504BIB006","doi-asserted-by":"publisher","DOI":"10.1287\/opre.50.3.490.7741"},{"key":"S0219622021500504BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00006-6"},{"key":"S0219622021500504BIB008","doi-asserted-by":"publisher","DOI":"10.1080\/03610910701723559"},{"key":"S0219622021500504BIB009","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2008-00425-1"},{"key":"S0219622021500504BIB010","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"S0219622021500504BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_17"},{"key":"S0219622021500504BIB012","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2014.950875"},{"key":"S0219622021500504BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-014-0754-6"},{"key":"S0219622021500504BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.07.001"},{"key":"S0219622021500504BIB015","volume-title":"Thirty-Second AAAI Conf. Artificial Intelligence","author":"Miyauchi","year":"2018"},{"key":"S0219622021500504BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-016-0443-1"},{"key":"S0219622021500504BIB017","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.41.9.1493"},{"key":"S0219622021500504BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.02.011"},{"key":"S0219622021500504BIB019","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.046112"},{"key":"S0219622021500504BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581239"},{"key":"S0219622021500504BIB021","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589097"},{"key":"S0219622021500504BIB022","doi-asserted-by":"publisher","DOI":"10.1002\/net.10004"},{"key":"S0219622021500504BIB023","doi-asserted-by":"publisher","DOI":"10.1080\/09720510.2017.1395182"},{"key":"S0219622021500504BIB024","first-page":"12","volume":"7","author":"Hvattum L. M.","year":"2012","journal-title":"Algorithmic Operations Research"},{"key":"S0219622021500504BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.10.019"},{"key":"S0219622021500504BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.109599"},{"key":"S0219622021500504BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.12.008"},{"key":"S0219622021500504BIB028","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2009.00696.x"},{"key":"S0219622021500504BIB029","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-014-0003-y"},{"key":"S0219622021500504BIB030","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.10.009"},{"key":"S0219622021500504BIB032","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"S0219622021500504BIB033","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-016-9856-7"},{"key":"S0219622021500504BIB034","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2018.2832440"},{"key":"S0219622021500504BIB035","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.07.023"},{"key":"S0219622021500504BIB036","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.06.050"},{"key":"S0219622021500504BIB037","first-page":"21","author":"Forrester Richard J.","year":"2020","journal-title":"Journal of Applied Mathematics"},{"issue":"2","key":"S0219622021500504BIB038","doi-asserted-by":"crossref","DOI":"10.1007\/s10479-019-03415-8","volume":"279","author":"Furini F.","year":"2019","journal-title":"Annals of OR"}],"container-title":["International Journal of Information Technology &amp; Decision Making"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219622021500504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T10:13:26Z","timestamp":1644833606000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219622021500504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,11]]},"references-count":37,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1142\/S0219622021500504"],"URL":"https:\/\/doi.org\/10.1142\/s0219622021500504","relation":{},"ISSN":["0219-6220","1793-6845"],"issn-type":[{"value":"0219-6220","type":"print"},{"value":"1793-6845","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,11]]}}}