{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:41:26Z","timestamp":1740120086990,"version":"3.37.3"},"reference-count":25,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T00:00:00Z","timestamp":1521763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["157277\/2014\u20103"],"award-info":[{"award-number":["157277\/2014\u20103"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int Trans Operational Res"],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This work introduces a heuristic for mixed integer programming (MIP) problems with binary variables, based on information obtained from differences between feasible solutions as well as solutions from the linear relaxation. This information is used to build a neighborhood that is explored as a sub\u2010MIP problem. The proposed heuristic is evaluated using 45 problems from the MIPLIB repository. Its performance, in terms of solution improvement over the results obtained after exploring 50,000 nodes of the branch\u2010and\u2010bound tree, is compared against that of Solution Polishing, which is another recombination\u2010based heuristic for MIP problems used within the CPLEX solver; as well as against the solution obtained by running the default CPLEX branch\u2010and\u2010cut (B&amp;C) method under a same time limit. The computational results indicate that the proposed method is able to yield results that are significantly better than those obtained by the default CPLEX B&amp;C approach and comparable to those of Solution Polishing in terms of the mean solution quality. This equivalence of expected solution quality, coupled with a simpler implementation, suggests the use of the proposed approach as a possible alternative for improving the quality of solutions in MIP problems.<\/jats:p>","DOI":"10.1111\/itor.12526","type":"journal-article","created":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T00:23:07Z","timestamp":1521850987000},"page":"418-434","update-policy":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A recombination\u2010based matheuristic for mixed integer programming problems with binary variables"],"prefix":"10.1111","volume":"27","author":[{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0002-5869-3052","authenticated-orcid":false,"given":"Andr\u00e9 L.","family":"Maravilha","sequence":"first","affiliation":[{"name":"Graduate Program in Electrical Engineering Universidade Federal de Minas Gerais Belo Horizonte 31270\u2010010 MG Brazil"},{"name":"Operations Research and Complex Systems Laboratory (ORCS Lab)  Belo Horizonte 31270\u2010010 MG Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo G.","family":"Carrano","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering Universidade Federal de Minas Gerais Belo Horizonte 31270\u2010010 MG Brazil"},{"name":"Operations Research and Complex Systems Laboratory (ORCS Lab)  Belo Horizonte 31270\u2010010 MG Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0001-8432-4325","authenticated-orcid":false,"given":"Felipe","family":"Campelo","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering Universidade Federal de Minas Gerais Belo Horizonte 31270\u2010010 MG Brazil"},{"name":"Operations Research and Complex Systems Laboratory (ORCS Lab)  Belo Horizonte 31270\u2010010 MG Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_8_2_1","DOI":"10.1016\/S0166-218X(01)00338-9"},{"unstructured":"Ahuja R.K. Orlin J.B. Sharma D. 1999.New neighborhood search structures for the capacitated minimum spanning tree problem. Technical Report 99\u20102 Department of Industrial & Systems Engineering University of Florida.","key":"e_1_2_8_3_1"},{"doi-asserted-by":"publisher","key":"e_1_2_8_4_1","DOI":"10.1007\/s12532-013-0060-9"},{"unstructured":"Birattari M. 2004.On the estimation of the expected performance of a metaheuristic on a class of instances: how many instances how many runs?Technical Report IRIDIA\/2004\u2010001 IRIDIA\u2014Universit\u00e9 Libre de Bruxelles.","key":"e_1_2_8_5_1"},{"doi-asserted-by":"publisher","key":"e_1_2_8_6_1","DOI":"10.1002\/9780470515075"},{"doi-asserted-by":"publisher","key":"e_1_2_8_7_1","DOI":"10.1007\/s10107-004-0518-7"},{"volume-title":"Evolutionary Computation: A Unified Approach","year":"2006","author":"De Jong K.A.","key":"e_1_2_8_8_1"},{"key":"e_1_2_8_9_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3023-4","volume-title":"Handbook of Combinatorial Optimization: Supplement","author":"Du D.","year":"1999"},{"key":"e_1_2_8_10_1","first-page":"103","volume-title":"Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, Annals of Information Systems","author":"Dumitrescu I.","year":"2010"},{"doi-asserted-by":"publisher","key":"e_1_2_8_11_1","DOI":"10.1007\/s10107-004-0570-3"},{"doi-asserted-by":"publisher","key":"e_1_2_8_12_1","DOI":"10.1007\/s10107-003-0395-5"},{"year":"1979","author":"Garey M.R.","journal-title":"Computers and Intractability: A Guide to the Theory of NP\u2010Completeness","key":"e_1_2_8_13_1"},{"doi-asserted-by":"publisher","key":"e_1_2_8_14_1","DOI":"10.1007\/978-1-4419-1665-5"},{"doi-asserted-by":"publisher","key":"e_1_2_8_15_1","DOI":"10.1007\/978-3-540-72792-7_24"},{"doi-asserted-by":"publisher","key":"e_1_2_8_16_1","DOI":"10.1007\/978-1-4615-4102-8_1"},{"key":"e_1_2_8_17_1","first-page":"1","volume-title":"A pre\u2010processing aware RINS based MIP heuristic","author":"Gomes T.M.","year":"2013"},{"doi-asserted-by":"publisher","key":"e_1_2_8_18_1","DOI":"10.1007\/s12532-011-0025-9"},{"doi-asserted-by":"publisher","key":"e_1_2_8_19_1","DOI":"10.1016\/j.orp.2016.09.002"},{"doi-asserted-by":"publisher","key":"e_1_2_8_20_1","DOI":"10.1007\/978-1-4419-1306-7"},{"year":"2013","author":"Montgomery D.C.","journal-title":"Applied Statistics and Probability for Engineers","key":"e_1_2_8_21_1"},{"doi-asserted-by":"publisher","key":"e_1_2_8_22_1","DOI":"10.1007\/978-3-540-78295-7_2"},{"doi-asserted-by":"publisher","key":"e_1_2_8_23_1","DOI":"10.1007\/978-1-4419-1665-5_16"},{"doi-asserted-by":"publisher","key":"e_1_2_8_24_1","DOI":"10.1007\/978-1-4419-1665-5_4"},{"doi-asserted-by":"publisher","key":"e_1_2_8_25_1","DOI":"10.1287\/ijoc.1060.0189"},{"volume-title":"Integer Programming. Wiley Series in Discrete Mathematics and Optimization","year":"1998","author":"Wolsey L.A.","key":"e_1_2_8_26_1"}],"container-title":["International Transactions in Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fitor.12526","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/itor.12526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,10]],"date-time":"2023-09-10T06:32:10Z","timestamp":1694327530000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1111\/itor.12526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,23]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1111\/itor.12526"],"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1111\/itor.12526","archive":["Portico"],"relation":{},"ISSN":["0969-6016","1475-3995"],"issn-type":[{"type":"print","value":"0969-6016"},{"type":"electronic","value":"1475-3995"}],"subject":[],"published":{"date-parts":[[2018,3,23]]},"assertion":[{"value":"2016-10-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-02-15","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}