Local-MIP: Efficient local search for mixed integer programming
Mixed Integer Programming (MIP) is a fundamental model in operations research with broad industrial applications. Local search is a powerful methodology for solving complex optimization problems; however, the development of local search algorithms for MIP still needs exploration. In this work, we pr...
Uloženo v:
| Vydáno v: | Artificial intelligence Ročník 348; s. 104405 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.11.2025
|
| Témata: | |
| ISSN: | 0004-3702 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Mixed Integer Programming (MIP) is a fundamental model in operations research with broad industrial applications. Local search is a powerful methodology for solving complex optimization problems; however, the development of local search algorithms for MIP still needs exploration. In this work, we propose Local-MIP, an efficient local search algorithm tailored for MIP that integrates novel operators and employs a two-mode architecture to adaptively apply operators based on the current solution's feasibility. For the feasible mode, we propose the lift move operator and a corresponding lift process to improve the objective value while maintaining feasibility. For the infeasible mode, we propose the breakthrough move and mixed tight move operators to respectively optimize the objective function and satisfy constraints. To apply operators intelligently, we develop a dynamic weighting scheme that balances the priorities of the objective function and constraints. Furthermore, we propose a two-level scoring function structure that hierarchically selects operations, guiding the search toward high-quality feasible solutions. Experiments are conducted on public benchmarks to compare Local-MIP with state-of-the-art MIP solvers in finding high-quality solutions. The results show that Local-MIP significantly outperforms CPLEX, HiGHS, SCIP, and Feasibility Jump while remaining competitive with the commercial solver Gurobi on challenging problems within short time limits. Moreover, Local-MIP establishes 10 new records on MIPLIB open instances. |
|---|---|
| AbstractList | Mixed Integer Programming (MIP) is a fundamental model in operations research with broad industrial applications. Local search is a powerful methodology for solving complex optimization problems; however, the development of local search algorithms for MIP still needs exploration. In this work, we propose Local-MIP, an efficient local search algorithm tailored for MIP that integrates novel operators and employs a two-mode architecture to adaptively apply operators based on the current solution's feasibility. For the feasible mode, we propose the lift move operator and a corresponding lift process to improve the objective value while maintaining feasibility. For the infeasible mode, we propose the breakthrough move and mixed tight move operators to respectively optimize the objective function and satisfy constraints. To apply operators intelligently, we develop a dynamic weighting scheme that balances the priorities of the objective function and constraints. Furthermore, we propose a two-level scoring function structure that hierarchically selects operations, guiding the search toward high-quality feasible solutions. Experiments are conducted on public benchmarks to compare Local-MIP with state-of-the-art MIP solvers in finding high-quality solutions. The results show that Local-MIP significantly outperforms CPLEX, HiGHS, SCIP, and Feasibility Jump while remaining competitive with the commercial solver Gurobi on challenging problems within short time limits. Moreover, Local-MIP establishes 10 new records on MIPLIB open instances. |
| ArticleNumber | 104405 |
| Author | Lin, Jinkun Lin, Peng Zou, Mengchuan Cai, Shaowei |
| Author_xml | – sequence: 1 givenname: Peng orcidid: 0009-0002-4183-5998 surname: Lin fullname: Lin, Peng email: linpeng@ios.ac.cn organization: Key Laboratory of System Software (Chinese Academy of Sciences), Institute of Software, Chinese Academy of Sciences, Beijing, China – sequence: 2 givenname: Shaowei orcidid: 0000-0003-1730-6922 surname: Cai fullname: Cai, Shaowei email: caisw@ios.ac.cn organization: Key Laboratory of System Software (Chinese Academy of Sciences), Institute of Software, Chinese Academy of Sciences, Beijing, China – sequence: 3 givenname: Mengchuan surname: Zou fullname: Zou, Mengchuan email: zoumc@ios.ac.cn organization: Key Laboratory of System Software (Chinese Academy of Sciences), Institute of Software, Chinese Academy of Sciences, Beijing, China – sequence: 4 givenname: Jinkun surname: Lin fullname: Lin, Jinkun email: linjk@seedmath.com organization: SeedMath Technology Limited, Beijing, China |
| BookMark | eNp9j81KxDAUhbMYwZnRN3CRF-iYNEnTulBkGMeBii50HdLkpqb0Z0iK6NvbUteuLvfA-TjfBq36oQeEbijZUUKz22anw-j7cZeSVEwR50Ss0JoQwhMmSXqJNjE208uKgq7RQzkY3SYvp7c7fHDOGw_9iNs5xBF0MJ_YDQF3_hssnrBQQ8DnMNRBd53v6yt04XQb4frvbtHH0-F9_5yUr8fT_rFMTCrkmEiqNSucFUY7IjMtpTWikiJnOheGsowz5nLBi0zAvKyi1IrKVTYzwKmTbIv4wjVhiDGAU-fgOx1-FCVqFleNWsTVLK4W8al2v9Rg2vblIag4GxqwPoAZlR38_4Bf6nxmzw |
| Cites_doi | 10.1007/s10107-002-0319-9 10.1016/j.jss.2003.12.040 10.1007/s12532-017-0130-5 10.1007/s10479-005-3446-x 10.1287/opre.14.4.699 10.1023/A:1006350622830 10.1007/s10107-004-0570-3 10.1137/S00361445023685 10.1007/s12532-019-00159-1 10.1016/j.cor.2016.04.006 10.1613/jair.4480 10.1287/ijoc.6.4.445 10.1016/j.ejor.2016.04.030 10.1111/itor.13299 10.1145/3585516 10.1007/s12532-020-00194-3 10.1007/s12532-008-0001-1 10.1016/j.artint.2013.09.001 10.1007/s12532-023-00234-8 10.1007/BF00226291 10.1016/j.artint.2024.104242 10.1007/s10732-014-9271-0 10.1016/0377-2217(93)90182-M 10.2140/pjm.1955.5.183 10.1016/j.artint.2020.103354 10.1007/s10817-005-9010-1 10.1007/s10288-011-0165-9 10.1134/S1990478912010048 10.1016/j.ijpe.2014.06.011 |
| ContentType | Journal Article |
| Copyright | 2025 Elsevier B.V. |
| Copyright_xml | – notice: 2025 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.artint.2025.104405 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_artint_2025_104405 S0004370225001249 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 4.4 457 4G. 5GY 5VS 6J9 6TJ 7-5 71M 77I 77K 8P~ 9JN AAEDT AAEDW AAIKJ AAKOC AAKPC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO ABBOA ABDPE ABFNM ABFRF ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFO ACGFS ACLOT ACNCT ACNNM ACRLP ACRPL ACVFH ACWUS ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO ADVLN AEBSH AECPX AEFWE AEIPS AEKER AENEX AETEA AEUPX AEXQZ AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 E3Z EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HLZ HVGLF HZ~ IHE IXB J1W JJJVA KOM LG9 LY7 M41 MO0 MVM N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RNS ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 TR2 TWZ UPT UQL WH7 WUQ XJE XPP XSW ZMT ~02 ~G- ~HD 9DU AAYXX CITATION |
| ID | FETCH-LOGICAL-c257t-71aa39fd5caf076a77dc5b7583a85c136433f854965e0399b11d5bfbd6ce41f73 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001565653000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0004-3702 |
| IngestDate | Sat Nov 29 06:56:07 EST 2025 Sat Nov 08 17:43:00 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Operator Local search Mixed integer programming Scoring function |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c257t-71aa39fd5caf076a77dc5b7583a85c136433f854965e0399b11d5bfbd6ce41f73 |
| ORCID | 0000-0003-1730-6922 0009-0002-4183-5998 |
| ParticipantIDs | crossref_primary_10_1016_j_artint_2025_104405 elsevier_sciencedirect_doi_10_1016_j_artint_2025_104405 |
| PublicationCentury | 2000 |
| PublicationDate | November 2025 2025-11-00 |
| PublicationDateYYYYMMDD | 2025-11-01 |
| PublicationDate_xml | – month: 11 year: 2025 text: November 2025 |
| PublicationDecade | 2020 |
| PublicationTitle | Artificial intelligence |
| PublicationYear | 2025 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Kautz, Sabharwal, Selman (br0140) 2021; vol. 336 Lei, Cai (br0510) 2018 Nickel, Steinhardt, Schlenker, Burkart (br0270) 2022 Chu, Cai, Luo (br0380) 2023 Taillard (br0610) 1993; 64 Glover, Laguna (br0570) 1998 Karp (br0120) 1972 Gleixner, Hendel, Gamrath, Achterberg, Bastubbe, Berthold, Christophel, Jarck, Koch, Linderoth, Lübbecke, Mittelmann, Özyurt, Ralphs, Salvagnin, Shinano (br0590) 2021; 13 Berthold, Hendel (br0220) 2015; 21 Fischetti, Glover, Lodi (br0210) 2005; 104 Melo, Ribeiro (br0080) 2023; 30 Chu, Cai, Luo, Lei, Peng (br0410) 2023; vol. 280 Cha, Iwama, Kambayashi, Miyazaki (br0350) 1997 Ku, Beck (br0070) 2016; 73 Lin, Zou, Cai (br0470) 2024; vol. 307 Smith, Taskin (br0030) 2008 Lodi, Monaci (br0050) 2003; 94 Dantzig, Orden, Wolfe (br0490) 1955; 5 Fischetti, Lodi (br0150) 2010 Beresnev, Goncharov, Mel'nikov (br0390) 2012; 6 Gurobi (br0260) 2024 Gertphol, Prasanna (br0110) 2005; 77 Gomory (br0180) 2010 Cai, Luo, Su (br0560) 2014; 51 Land, Doig (br0160) 2010 Savelsbergh (br0190) 1994; 6 Achterberg (br0250) 2009; 1 Davies, Didier, Perron (br0450) 2024; vol. 14742 Salvagnin, Roberti, Fischetti (br0240) 2024 Cai, Li, Zhang (br0550) 2022; vol. 13372 Li, Li (br0330) 2012; vol. 7317 Falkenauer (br0600) 1996; 2 Thornton, Pham, Bain, Jr. (br0540) 2004 Benoist, Estellon, Gardi, Megel, Nouioua (br0650) 2011; 9 Wolsey (br0020) 2008 Cai, Su (br0340) 2013; 204 Lin, Cai, Zou, Lin (br0480) 2023 Balint, Schöning (br0320) 2012; vol. 7317 Walser, Iyer, Venkatasubramanyan (br0420) 1998 Abdi (br0640) 2010; 1 Lei, Cai, Luo, Hoos (br0400) 2021; vol. 12831 Cai (br0580) 2015 Delorme, Iori, Martello (br0620) 2016; 255 Gamrath, Berthold, Heinz, Winkler (br0230) 2019; 11 Achterberg, Wunderling (br0010) 2013 Kannan, Monma (br0130) 1978 Zheng, He, Zhou, Jin, Li, Manyà (br0370) 2025; 338 Thornton (br0530) 2005; 35 Huangfu, Hall (br0290) 2018; 10 Cai, Li, Zhang (br0500) 2022 Floudas, Lin (br0100) 2005; 139 Cai, Lei (br0360) 2020; 287 Naderi, Zandieh (br0630) 2014; 158 Davies, Bacchus (br0040) 2013; vol. 7962 Pochet, Wolsey (br0090) 2006 Hoos, Stützle (br0300) 2004 Luteberget, Sartor (br0440) 2023; 15 Pataki (br0060) 2003; 45 Prestwich, Verachi (br0430) 2008 Perron, Didier, Gay (br0460) 2023; vol. 280 Thornton, Sattar (br0520) 1998; vol. 1531 Lawler, Wood (br0170) 1966; 14 Berthold (br0200) 2006 Bestuzheva, Besançon, Chen, Chmiela, Donkiewicz, van Doornmalen, Eifler, Gaul, Gamrath, Gleixner, Gottwald, Graczyk, Halbig, Hoen, Hojny, van der Hulst, Koch, Lübbecke, Maher, Matter, Mühmer, Müller, Pfetsch, Rehfeldt, Schlein, Schlösser, Serrano, Shinano, Sofranac, Turner, Vigerske, Wegscheider, Wellner, Weninger, Witzig (br0280) 2023; 49 Hoos, Stützle (br0310) 2000; 24 Prestwich (10.1016/j.artint.2025.104405_br0430) 2008 Davies (10.1016/j.artint.2025.104405_br0450) 2024; vol. 14742 Zheng (10.1016/j.artint.2025.104405_br0370) 2025; 338 Lodi (10.1016/j.artint.2025.104405_br0050) 2003; 94 Lei (10.1016/j.artint.2025.104405_br0510) 2018 Fischetti (10.1016/j.artint.2025.104405_br0210) 2005; 104 Chu (10.1016/j.artint.2025.104405_br0410) 2023; vol. 280 Melo (10.1016/j.artint.2025.104405_br0080) 2023; 30 Cai (10.1016/j.artint.2025.104405_br0550) 2022; vol. 13372 Naderi (10.1016/j.artint.2025.104405_br0630) 2014; 158 Beresnev (10.1016/j.artint.2025.104405_br0390) 2012; 6 Delorme (10.1016/j.artint.2025.104405_br0620) 2016; 255 Abdi (10.1016/j.artint.2025.104405_br0640) 2010; 1 Hoos (10.1016/j.artint.2025.104405_br0300) 2004 Lin (10.1016/j.artint.2025.104405_br0480) Nickel (10.1016/j.artint.2025.104405_br0270) 2022 Gomory (10.1016/j.artint.2025.104405_br0180) 2010 Cha (10.1016/j.artint.2025.104405_br0350) 1997 Cai (10.1016/j.artint.2025.104405_br0560) 2014; 51 Gertphol (10.1016/j.artint.2025.104405_br0110) 2005; 77 Smith (10.1016/j.artint.2025.104405_br0030) 2008 Savelsbergh (10.1016/j.artint.2025.104405_br0190) 1994; 6 Gurobi (10.1016/j.artint.2025.104405_br0260) 2024 Thornton (10.1016/j.artint.2025.104405_br0530) 2005; 35 Dantzig (10.1016/j.artint.2025.104405_br0490) 1955; 5 Thornton (10.1016/j.artint.2025.104405_br0520) 1998; vol. 1531 Salvagnin (10.1016/j.artint.2025.104405_br0240) 2024 Lin (10.1016/j.artint.2025.104405_br0470) 2024; vol. 307 Cai (10.1016/j.artint.2025.104405_br0580) 2015 Gamrath (10.1016/j.artint.2025.104405_br0230) 2019; 11 Thornton (10.1016/j.artint.2025.104405_br0540) 2004 Bestuzheva (10.1016/j.artint.2025.104405_br0280) 2023; 49 Pochet (10.1016/j.artint.2025.104405_br0090) 2006 Benoist (10.1016/j.artint.2025.104405_br0650) 2011; 9 Chu (10.1016/j.artint.2025.104405_br0380) 2023 Taillard (10.1016/j.artint.2025.104405_br0610) 1993; 64 Perron (10.1016/j.artint.2025.104405_br0460) 2023; vol. 280 Fischetti (10.1016/j.artint.2025.104405_br0150) 2010 Huangfu (10.1016/j.artint.2025.104405_br0290) 2018; 10 Lei (10.1016/j.artint.2025.104405_br0400) 2021; vol. 12831 Glover (10.1016/j.artint.2025.104405_br0570) 1998 Pataki (10.1016/j.artint.2025.104405_br0060) 2003; 45 Li (10.1016/j.artint.2025.104405_br0330) 2012; vol. 7317 Berthold (10.1016/j.artint.2025.104405_br0220) 2015; 21 Balint (10.1016/j.artint.2025.104405_br0320) 2012; vol. 7317 Cai (10.1016/j.artint.2025.104405_br0500) 2022 Cai (10.1016/j.artint.2025.104405_br0360) 2020; 287 Kannan (10.1016/j.artint.2025.104405_br0130) 1978 Wolsey (10.1016/j.artint.2025.104405_br0020) 2008 Kautz (10.1016/j.artint.2025.104405_br0140) 2021; vol. 336 Achterberg (10.1016/j.artint.2025.104405_br0250) 2009; 1 Achterberg (10.1016/j.artint.2025.104405_br0010) 2013 Davies (10.1016/j.artint.2025.104405_br0040) 2013; vol. 7962 Cai (10.1016/j.artint.2025.104405_br0340) 2013; 204 Luteberget (10.1016/j.artint.2025.104405_br0440) 2023; 15 Hoos (10.1016/j.artint.2025.104405_br0310) 2000; 24 Walser (10.1016/j.artint.2025.104405_br0420) 1998 Falkenauer (10.1016/j.artint.2025.104405_br0600) 1996; 2 Berthold (10.1016/j.artint.2025.104405_br0200) 2006 Land (10.1016/j.artint.2025.104405_br0160) 2010 Gleixner (10.1016/j.artint.2025.104405_br0590) 2021; 13 Lawler (10.1016/j.artint.2025.104405_br0170) 1966; 14 Karp (10.1016/j.artint.2025.104405_br0120) 1972 Ku (10.1016/j.artint.2025.104405_br0070) 2016; 73 Floudas (10.1016/j.artint.2025.104405_br0100) 2005; 139 |
| References_xml | – volume: 10 start-page: 119 year: 2018 end-page: 142 ident: br0290 article-title: Parallelizing the dual revised simplex method publication-title: Math. Program. Comput. – volume: 15 start-page: 365 year: 2023 end-page: 388 ident: br0440 article-title: Feasibility jump: an lp-free Lagrangian MIP heuristic publication-title: Math. Program. Comput. – start-page: 85 year: 1972 end-page: 103 ident: br0120 article-title: Reducibility among combinatorial problems publication-title: Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights – year: 1998 ident: br0570 article-title: Tabu Search – year: 2008 ident: br0430 article-title: Constructive vs perturbative local search for general integer linear programming publication-title: Proceedings of the Fifth International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS) – volume: vol. 280 year: 2023 ident: br0410 article-title: Towards more efficient local search for pseudo-Boolean optimization publication-title: 29th International Conference on Principles and Practice of Constraint Programming – volume: vol. 7962 start-page: 166 year: 2013 end-page: 181 ident: br0040 article-title: Exploiting the power of mip solvers in maxsat publication-title: Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Proceedings – year: 2006 ident: br0200 article-title: Primal heuristics for mixed integer programs – volume: 45 start-page: 116 year: 2003 end-page: 123 ident: br0060 article-title: Teaching integer programming formulations using the traveling salesman problem publication-title: SIAM Rev. – volume: 64 start-page: 278 year: 1993 end-page: 285 ident: br0610 article-title: Benchmarks for basic scheduling problems publication-title: Eur. J. Oper. Res. – volume: 9 start-page: 299 year: 2011 end-page: 316 ident: br0650 article-title: Localsolver 1.x: a black-box local-search solver for 0-1 programming publication-title: 4OR – start-page: 521 year: 2008 end-page: 548 ident: br0030 article-title: A tutorial guide to mixed-integer programming models and solution techniques publication-title: Optimization in Medicine and Biology – volume: vol. 307 year: 2024 ident: br0470 article-title: An efficient local search solver for mixed integer programming publication-title: 30th International Conference on Principles and Practice of Constraint Programming – volume: vol. 13372 start-page: 227 year: 2022 end-page: 248 ident: br0550 article-title: Local search for SMT on linear integer arithmetic publication-title: Computer Aided Verification - 34th International Conference, Proceedings, Part II – volume: vol. 336 start-page: 213 year: 2021 end-page: 232 ident: br0140 article-title: Incomplete algorithms publication-title: Handbook of Satisfiability – start-page: 747 year: 2015 end-page: 753 ident: br0580 article-title: Balance between complexity and quality: local search for minimum vertex cover in massive graphs publication-title: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires – start-page: 161 year: 1978 end-page: 172 ident: br0130 article-title: On the computational complexity of integer programming problems publication-title: Optimization and Operations Research: Proceedings of a Workshop Held at the University of Bonn – start-page: 3915 year: 2023 end-page: 3923 ident: br0380 article-title: Nuwls: improving local search for (weighted) partial maxsat by new weighting techniques publication-title: Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence – volume: vol. 280 year: 2023 ident: br0460 article-title: The CP-SAT-LP solver publication-title: 29th International Conference on Principles and Practice of Constraint Programming (CP 2023) – volume: vol. 1531 start-page: 377 year: 1998 end-page: 388 ident: br0520 article-title: Dynamic constraint weighting for over-constrained problems publication-title: PRICAI'98, Topics in Artificial Intelligence, 5th Pacific Rim International Conference on Artificial Intelligence, Proceedings – volume: vol. 12831 start-page: 332 year: 2021 end-page: 348 ident: br0400 article-title: Efficient local search for pseudo Boolean optimization publication-title: Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Proceedings – year: 2004 ident: br0300 article-title: Stochastic Local Search: Foundations & Applications – year: 2008 ident: br0020 article-title: Mixed integer programming publication-title: Wiley Encyclopedia of Computer Science and Engineering – volume: 13 start-page: 443 year: 2021 end-page: 490 ident: br0590 article-title: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library publication-title: Math. Program. Comput. – volume: 104 start-page: 91 year: 2005 end-page: 104 ident: br0210 article-title: The feasibility pump publication-title: Math. Program. – year: 2023 ident: br0480 article-title: New characterizations and efficient local search for general integer linear programming – volume: 139 start-page: 131 year: 2005 end-page: 162 ident: br0100 article-title: Mixed integer linear programming in process scheduling: modeling, algorithms, and applications publication-title: Ann. Oper. Res. – volume: 6 start-page: 22 year: 2012 end-page: 30 ident: br0390 article-title: Local search with a generalized neighborhood in the optimization problem for pseudo-Boolean functions publication-title: J. Appl. Ind. Math. – start-page: 105 year: 2010 end-page: 132 ident: br0160 article-title: An automatic method for solving discrete programming problems publication-title: 50 Years of Integer Programming 1958-2008 - from the Early Years to the State-of-the-Art – start-page: 449 year: 2013 end-page: 481 ident: br0010 article-title: Mixed integer programming: analyzing 12 years of progress publication-title: Facets of Combinatorial Optimization: Festschrift for Martin Grötschel – volume: 21 start-page: 73 year: 2015 end-page: 106 ident: br0220 article-title: Shift-and-propagate publication-title: J. Heuristics – volume: vol. 7317 start-page: 16 year: 2012 end-page: 29 ident: br0320 article-title: Choosing probability distributions for stochastic local search and the role of make versus break publication-title: Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Proceedings – volume: vol. 7317 start-page: 477 year: 2012 end-page: 478 ident: br0330 article-title: Satisfying versus falsifying in local search for satisfiability - (poster presentation) publication-title: Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Proceedings – volume: 73 start-page: 165 year: 2016 end-page: 173 ident: br0070 article-title: Mixed integer programming models for job shop scheduling: a computational analysis publication-title: Comput. Oper. Res. – start-page: 77 year: 2010 end-page: 103 ident: br0180 article-title: Outline of an algorithm for integer solutions to linear programs and an algorithm for the mixed integer problem publication-title: 50 Years of Integer Programming 1958-2008 - from the Early Years to the State-of-the-Art – volume: 30 start-page: 3159 year: 2023 end-page: 3200 ident: br0080 article-title: MIP formulations for induced graph optimization problems: a tutorial publication-title: Int. Trans. Oper. Res. – volume: 1 start-page: 1 year: 2009 end-page: 41 ident: br0250 article-title: SCIP: solving constraint integer programs publication-title: Math. Program. Comput. – volume: 2 start-page: 5 year: 1996 end-page: 30 ident: br0600 article-title: A hybrid grouping genetic algorithm for bin packing publication-title: J. Heuristics – volume: 1 year: 2010 ident: br0640 article-title: Coefficient of variation publication-title: Encycl. Res. Design – start-page: 1 year: 2024 end-page: 29 ident: br0240 article-title: A fix-propagate-repair heuristic for mixed integer programming publication-title: Math. Program. Comput. – volume: 11 start-page: 675 year: 2019 end-page: 702 ident: br0230 article-title: Structure-driven fix-and-propagate heuristics for mixed integer programming publication-title: Math. Program. Comput. – year: 2010 ident: br0150 article-title: Heuristics in mixed integer programming publication-title: Wiley Encyclopedia of Operations Research and Management Science – start-page: 1346 year: 2018 end-page: 1352 ident: br0510 article-title: Solving (weighted) partial maxsat by dynamic local search for SAT publication-title: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence – start-page: 263 year: 1997 end-page: 268 ident: br0350 article-title: Local search algorithms for partial MAXSAT publication-title: Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference – year: 2006 ident: br0090 article-title: Production Planning by Mixed Integer Programming, vol. 149 – volume: 287 year: 2020 ident: br0360 article-title: Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability publication-title: Artif. Intell. – volume: 49 year: 2023 ident: br0280 article-title: Enabling research through the SCIP optimization suite 8.0 publication-title: ACM Trans. Math. Softw. – volume: 5 start-page: 183 year: 1955 end-page: 195 ident: br0490 article-title: The generalized simplex method for minimizing a linear form under linear inequality restraints publication-title: Pac. J. Math. – volume: 51 start-page: 413 year: 2014 end-page: 441 ident: br0560 article-title: Scoring functions based on second level score for k-sat with long clauses publication-title: J. Artif. Intell. Res. – year: 2024 ident: br0260 article-title: Optimization, Gurobi Optimizer Ref. Manual – volume: 204 start-page: 75 year: 2013 end-page: 98 ident: br0340 article-title: Local search for Boolean satisfiability with configuration checking and subscore publication-title: Artif. Intell. – volume: 338 year: 2025 ident: br0370 article-title: Integrating multi-armed bandit with local search for maxsat publication-title: Artif. Intell. – volume: 24 start-page: 421 year: 2000 end-page: 481 ident: br0310 article-title: Local search algorithms for SAT: an empirical evaluation publication-title: J. Autom. Reason. – start-page: 227 year: 2022 end-page: 248 ident: br0500 article-title: Local search for smt on linear integer arithmetic publication-title: Computer Aided Verification: 34th International Conference, Proceedings, Part II – volume: 94 start-page: 257 year: 2003 end-page: 278 ident: br0050 article-title: Integer linear programming models for 2-staged two-dimensional knapsack problems publication-title: Math. Program. – volume: 6 start-page: 445 year: 1994 end-page: 454 ident: br0190 article-title: Preprocessing and probing techniques for mixed integer programming problems publication-title: INFORMS J. Comput. – volume: vol. 14742 start-page: 243 year: 2024 end-page: 258 ident: br0450 article-title: Violationls: constraint-based local search in CP-SAT publication-title: Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 21st International Conference, Proceedings, Part I – start-page: 373 year: 1998 end-page: 379 ident: br0420 article-title: An integer local search method with application to capacitated production planning publication-title: AAAI/IAAI – volume: 14 start-page: 699 year: 1966 end-page: 719 ident: br0170 article-title: Branch-and-bound methods: a survey publication-title: Oper. Res. – volume: 77 start-page: 55 year: 2005 end-page: 65 ident: br0110 article-title: MIP formulation for robust resource allocation in dynamic real-time systems publication-title: J. Syst. Softw. – volume: 255 start-page: 1 year: 2016 end-page: 20 ident: br0620 article-title: Bin packing and cutting stock problems: mathematical models and exact algorithms publication-title: Eur. J. Oper. Res. – volume: 35 start-page: 97 year: 2005 end-page: 142 ident: br0530 article-title: Clause weighting local search for SAT publication-title: J. Autom. Reason. – start-page: 9 year: 2022 end-page: 21 ident: br0270 article-title: Ibm ilog cplex optimization studio—a primer publication-title: Decision Optimization with IBM ILOG CPLEX Optimization Studio: A Hands-On Introduction to Modeling with the Optimization Programming Language (OPL) – start-page: 191 year: 2004 end-page: 196 ident: br0540 article-title: Additive versus multiplicative clause weighting for SAT publication-title: Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence – volume: 158 start-page: 256 year: 2014 end-page: 266 ident: br0630 article-title: Modeling and scheduling no-wait open shop problems publication-title: Int. J. Prod. Econ. – volume: 94 start-page: 257 year: 2003 ident: 10.1016/j.artint.2025.104405_br0050 article-title: Integer linear programming models for 2-staged two-dimensional knapsack problems publication-title: Math. Program. doi: 10.1007/s10107-002-0319-9 – start-page: 521 year: 2008 ident: 10.1016/j.artint.2025.104405_br0030 article-title: A tutorial guide to mixed-integer programming models and solution techniques – volume: vol. 7317 start-page: 477 year: 2012 ident: 10.1016/j.artint.2025.104405_br0330 article-title: Satisfying versus falsifying in local search for satisfiability - (poster presentation) – volume: 77 start-page: 55 year: 2005 ident: 10.1016/j.artint.2025.104405_br0110 article-title: MIP formulation for robust resource allocation in dynamic real-time systems publication-title: J. Syst. Softw. doi: 10.1016/j.jss.2003.12.040 – start-page: 449 year: 2013 ident: 10.1016/j.artint.2025.104405_br0010 article-title: Mixed integer programming: analyzing 12 years of progress – start-page: 263 year: 1997 ident: 10.1016/j.artint.2025.104405_br0350 article-title: Local search algorithms for partial MAXSAT – volume: 10 start-page: 119 year: 2018 ident: 10.1016/j.artint.2025.104405_br0290 article-title: Parallelizing the dual revised simplex method publication-title: Math. Program. Comput. doi: 10.1007/s12532-017-0130-5 – volume: vol. 12831 start-page: 332 year: 2021 ident: 10.1016/j.artint.2025.104405_br0400 article-title: Efficient local search for pseudo Boolean optimization – volume: 139 start-page: 131 year: 2005 ident: 10.1016/j.artint.2025.104405_br0100 article-title: Mixed integer linear programming in process scheduling: modeling, algorithms, and applications publication-title: Ann. Oper. Res. doi: 10.1007/s10479-005-3446-x – volume: 14 start-page: 699 year: 1966 ident: 10.1016/j.artint.2025.104405_br0170 article-title: Branch-and-bound methods: a survey publication-title: Oper. Res. doi: 10.1287/opre.14.4.699 – volume: vol. 13372 start-page: 227 year: 2022 ident: 10.1016/j.artint.2025.104405_br0550 article-title: Local search for SMT on linear integer arithmetic – year: 2008 ident: 10.1016/j.artint.2025.104405_br0430 article-title: Constructive vs perturbative local search for general integer linear programming – volume: 24 start-page: 421 year: 2000 ident: 10.1016/j.artint.2025.104405_br0310 article-title: Local search algorithms for SAT: an empirical evaluation publication-title: J. Autom. Reason. doi: 10.1023/A:1006350622830 – volume: 104 start-page: 91 year: 2005 ident: 10.1016/j.artint.2025.104405_br0210 article-title: The feasibility pump publication-title: Math. Program. doi: 10.1007/s10107-004-0570-3 – volume: 45 start-page: 116 year: 2003 ident: 10.1016/j.artint.2025.104405_br0060 article-title: Teaching integer programming formulations using the traveling salesman problem publication-title: SIAM Rev. doi: 10.1137/S00361445023685 – start-page: 191 year: 2004 ident: 10.1016/j.artint.2025.104405_br0540 article-title: Additive versus multiplicative clause weighting for SAT – volume: vol. 1531 start-page: 377 year: 1998 ident: 10.1016/j.artint.2025.104405_br0520 article-title: Dynamic constraint weighting for over-constrained problems – year: 2024 ident: 10.1016/j.artint.2025.104405_br0260 – volume: 11 start-page: 675 year: 2019 ident: 10.1016/j.artint.2025.104405_br0230 article-title: Structure-driven fix-and-propagate heuristics for mixed integer programming publication-title: Math. Program. Comput. doi: 10.1007/s12532-019-00159-1 – volume: 1 year: 2010 ident: 10.1016/j.artint.2025.104405_br0640 article-title: Coefficient of variation publication-title: Encycl. Res. Design – volume: vol. 280 year: 2023 ident: 10.1016/j.artint.2025.104405_br0460 article-title: The CP-SAT-LP solver – start-page: 3915 year: 2023 ident: 10.1016/j.artint.2025.104405_br0380 article-title: Nuwls: improving local search for (weighted) partial maxsat by new weighting techniques – volume: vol. 7317 start-page: 16 year: 2012 ident: 10.1016/j.artint.2025.104405_br0320 article-title: Choosing probability distributions for stochastic local search and the role of make versus break – start-page: 161 year: 1978 ident: 10.1016/j.artint.2025.104405_br0130 article-title: On the computational complexity of integer programming problems – volume: 73 start-page: 165 year: 2016 ident: 10.1016/j.artint.2025.104405_br0070 article-title: Mixed integer programming models for job shop scheduling: a computational analysis publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.04.006 – volume: 51 start-page: 413 year: 2014 ident: 10.1016/j.artint.2025.104405_br0560 article-title: Scoring functions based on second level score for k-sat with long clauses publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.4480 – start-page: 9 year: 2022 ident: 10.1016/j.artint.2025.104405_br0270 article-title: Ibm ilog cplex optimization studio—a primer – volume: 6 start-page: 445 year: 1994 ident: 10.1016/j.artint.2025.104405_br0190 article-title: Preprocessing and probing techniques for mixed integer programming problems publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.6.4.445 – year: 2006 ident: 10.1016/j.artint.2025.104405_br0200 – start-page: 227 year: 2022 ident: 10.1016/j.artint.2025.104405_br0500 article-title: Local search for smt on linear integer arithmetic – volume: vol. 280 year: 2023 ident: 10.1016/j.artint.2025.104405_br0410 article-title: Towards more efficient local search for pseudo-Boolean optimization – ident: 10.1016/j.artint.2025.104405_br0480 – volume: 255 start-page: 1 year: 2016 ident: 10.1016/j.artint.2025.104405_br0620 article-title: Bin packing and cutting stock problems: mathematical models and exact algorithms publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.04.030 – year: 2008 ident: 10.1016/j.artint.2025.104405_br0020 article-title: Mixed integer programming – volume: 30 start-page: 3159 year: 2023 ident: 10.1016/j.artint.2025.104405_br0080 article-title: MIP formulations for induced graph optimization problems: a tutorial publication-title: Int. Trans. Oper. Res. doi: 10.1111/itor.13299 – start-page: 373 year: 1998 ident: 10.1016/j.artint.2025.104405_br0420 article-title: An integer local search method with application to capacitated production planning – start-page: 85 year: 1972 ident: 10.1016/j.artint.2025.104405_br0120 article-title: Reducibility among combinatorial problems – volume: vol. 336 start-page: 213 year: 2021 ident: 10.1016/j.artint.2025.104405_br0140 article-title: Incomplete algorithms – volume: 49 year: 2023 ident: 10.1016/j.artint.2025.104405_br0280 article-title: Enabling research through the SCIP optimization suite 8.0 publication-title: ACM Trans. Math. Softw. doi: 10.1145/3585516 – volume: 13 start-page: 443 year: 2021 ident: 10.1016/j.artint.2025.104405_br0590 article-title: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library publication-title: Math. Program. Comput. doi: 10.1007/s12532-020-00194-3 – year: 2004 ident: 10.1016/j.artint.2025.104405_br0300 – volume: vol. 7962 start-page: 166 year: 2013 ident: 10.1016/j.artint.2025.104405_br0040 article-title: Exploiting the power of mip solvers in maxsat – volume: 1 start-page: 1 year: 2009 ident: 10.1016/j.artint.2025.104405_br0250 article-title: SCIP: solving constraint integer programs publication-title: Math. Program. Comput. doi: 10.1007/s12532-008-0001-1 – start-page: 747 year: 2015 ident: 10.1016/j.artint.2025.104405_br0580 article-title: Balance between complexity and quality: local search for minimum vertex cover in massive graphs – start-page: 1346 year: 2018 ident: 10.1016/j.artint.2025.104405_br0510 article-title: Solving (weighted) partial maxsat by dynamic local search for SAT – volume: 204 start-page: 75 year: 2013 ident: 10.1016/j.artint.2025.104405_br0340 article-title: Local search for Boolean satisfiability with configuration checking and subscore publication-title: Artif. Intell. doi: 10.1016/j.artint.2013.09.001 – volume: 15 start-page: 365 year: 2023 ident: 10.1016/j.artint.2025.104405_br0440 article-title: Feasibility jump: an lp-free Lagrangian MIP heuristic publication-title: Math. Program. Comput. doi: 10.1007/s12532-023-00234-8 – start-page: 1 year: 2024 ident: 10.1016/j.artint.2025.104405_br0240 article-title: A fix-propagate-repair heuristic for mixed integer programming publication-title: Math. Program. Comput. – volume: 2 start-page: 5 year: 1996 ident: 10.1016/j.artint.2025.104405_br0600 article-title: A hybrid grouping genetic algorithm for bin packing publication-title: J. Heuristics doi: 10.1007/BF00226291 – year: 1998 ident: 10.1016/j.artint.2025.104405_br0570 – year: 2006 ident: 10.1016/j.artint.2025.104405_br0090 – volume: vol. 307 year: 2024 ident: 10.1016/j.artint.2025.104405_br0470 article-title: An efficient local search solver for mixed integer programming – volume: 338 year: 2025 ident: 10.1016/j.artint.2025.104405_br0370 article-title: Integrating multi-armed bandit with local search for maxsat publication-title: Artif. Intell. doi: 10.1016/j.artint.2024.104242 – volume: vol. 14742 start-page: 243 year: 2024 ident: 10.1016/j.artint.2025.104405_br0450 article-title: Violationls: constraint-based local search in CP-SAT – volume: 21 start-page: 73 year: 2015 ident: 10.1016/j.artint.2025.104405_br0220 article-title: Shift-and-propagate publication-title: J. Heuristics doi: 10.1007/s10732-014-9271-0 – volume: 64 start-page: 278 year: 1993 ident: 10.1016/j.artint.2025.104405_br0610 article-title: Benchmarks for basic scheduling problems publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(93)90182-M – year: 2010 ident: 10.1016/j.artint.2025.104405_br0150 article-title: Heuristics in mixed integer programming – volume: 5 start-page: 183 year: 1955 ident: 10.1016/j.artint.2025.104405_br0490 article-title: The generalized simplex method for minimizing a linear form under linear inequality restraints publication-title: Pac. J. Math. doi: 10.2140/pjm.1955.5.183 – volume: 287 year: 2020 ident: 10.1016/j.artint.2025.104405_br0360 article-title: Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability publication-title: Artif. Intell. doi: 10.1016/j.artint.2020.103354 – start-page: 77 year: 2010 ident: 10.1016/j.artint.2025.104405_br0180 article-title: Outline of an algorithm for integer solutions to linear programs and an algorithm for the mixed integer problem – start-page: 105 year: 2010 ident: 10.1016/j.artint.2025.104405_br0160 article-title: An automatic method for solving discrete programming problems – volume: 35 start-page: 97 year: 2005 ident: 10.1016/j.artint.2025.104405_br0530 article-title: Clause weighting local search for SAT publication-title: J. Autom. Reason. doi: 10.1007/s10817-005-9010-1 – volume: 9 start-page: 299 year: 2011 ident: 10.1016/j.artint.2025.104405_br0650 article-title: Localsolver 1.x: a black-box local-search solver for 0-1 programming publication-title: 4OR doi: 10.1007/s10288-011-0165-9 – volume: 6 start-page: 22 year: 2012 ident: 10.1016/j.artint.2025.104405_br0390 article-title: Local search with a generalized neighborhood in the optimization problem for pseudo-Boolean functions publication-title: J. Appl. Ind. Math. doi: 10.1134/S1990478912010048 – volume: 158 start-page: 256 year: 2014 ident: 10.1016/j.artint.2025.104405_br0630 article-title: Modeling and scheduling no-wait open shop problems publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2014.06.011 |
| SSID | ssj0003991 |
| Score | 2.4729817 |
| Snippet | Mixed Integer Programming (MIP) is a fundamental model in operations research with broad industrial applications. Local search is a powerful methodology for... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 104405 |
| SubjectTerms | Local search Mixed integer programming Operator Scoring function |
| Title | Local-MIP: Efficient local search for mixed integer programming |
| URI | https://dx.doi.org/10.1016/j.artint.2025.104405 |
| Volume | 348 |
| WOSCitedRecordID | wos001565653000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0004-3702 databaseCode: AIEXJ dateStart: 20211209 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0003991 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JS8NAFB60evDiLtaNOXiTSCfJdBIvUqRipZaCC72FyWSCFUxLF-3P982SNFURPXgZwpBMwryPt-Wb9xA65YRTsGuK81SrOb5LYgfsDHPSAFy5mPvUpC6e2qzTCXq9sGuPEIx1OwGWZcFsFg7_VdQwB8JWR2f_IO5iUZiAaxA6jCB2GH8l-LayTs5dq6uC_aauEKH-92ujdWaTHIpb-NqfycSUi5CjnKf1mluyojCt5hLpzh6l4p0FjcdUIOhK-5T-maH5AffPfPAu-0VeejDVqVe4UTxPSzwg2wwMIuJpVs5AuNQexStrVR8UVW1Bq3qmgKbVi0R1tqbfqmyTPXg511UTFLvVpefz2xcrZH-yXAWfMKeqvURmlUitEplVltGKy2gYVNBKo9Xs3RZ2Glwz20_RfH1-sFKz_75-zfeOS8kZedhE6zaKwA0j_S20JLNttJF36MBWYe-gywIMF7iAAtZQwAYKGKCANRSwhQIuQWEXPV43H65uHNsywxGgeycOI5x7YZpQwdMaq3PGEkFjiAk9HlBBPPA_vTSgqkmAVBsQE5LQOI2TupA-SZm3hyrZIJP7CEs_JIkrpICI2fcYKPbEpZ6vEgQpTWNaRU6-H9HQVEaJfpJDFbF80yLr3RmvLQIk_PjkwR_fdIjW5jA9QpXJaCqP0ap4m_THoxMLgw9zi27E |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Local-MIP%3A+Efficient+local+search+for+mixed+integer+programming&rft.jtitle=Artificial+intelligence&rft.au=Lin%2C+Peng&rft.au=Cai%2C+Shaowei&rft.au=Zou%2C+Mengchuan&rft.au=Lin%2C+Jinkun&rft.date=2025-11-01&rft.issn=0004-3702&rft.volume=348&rft.spage=104405&rft_id=info:doi/10.1016%2Fj.artint.2025.104405&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_artint_2025_104405 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon |