{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:40:01Z","timestamp":1751100001788,"version":"3.41.0"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031959721","type":"print"},{"value":"9783031959738","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-95973-8_9","type":"book-chapter","created":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:01:08Z","timestamp":1751097668000},"page":"134-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-task Representation Learning for\u00a0Mixed Integer Linear Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5510-2158","authenticated-orcid":false,"given":"Junyang","family":"Cai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8733-2379","authenticated-orcid":false,"given":"Taoan","family":"Huang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6784-473X","authenticated-orcid":false,"given":"Bistra","family":"Dilkina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Achterberg, T., Berthold, T., Hendel, G.: Rounding and propagation heuristics for mixed integer programming. In: Operations Research Proceedings 2011: Selected Papers of the International Conference on Operations Research (OR 2011), 30August\u20132 September 2011, Zurich, Switzerland, pp. 71\u201376. Springer (2012)","DOI":"10.1007\/978-3-642-29210-1_12"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez, A.M., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1), 185\u2013195 (2017)","journal-title":"INFORMS J. Comput."},{"key":"9_CR4","unstructured":"Berthold, T.: Primal heuristics for mixed integer programs. Ph.D. thesis, Zuse Institute Berlin (ZIB) (2006)"},{"key":"9_CR5","unstructured":"Bolusani, S., et al.: The SCIP optimization suite 9.0. arXiv preprint arXiv:2402.17702 (2024)"},{"key":"9_CR6","unstructured":"Brody, S., Alon, U., Yahav, E.: How attentive are graph attention networks? arXiv preprint arXiv:2105.14491 (2021)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cai, J., Huang, T., Dilkina, B.: Learning backdoors for mixed integer programs with contrastive learning. arXiv preprint arXiv:2401.10467 (2024)","DOI":"10.3233\/FAIA240768"},{"key":"9_CR8","unstructured":"Cai, J., Kadioglu, S., Dilkina, B.: Balans: multi-armed bandits-based adaptive large neighborhood search for mixed-integer programming problem. arXiv preprint arXiv:2412.14382 (2024)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Cai, J., et al.: Getting away with more network pruning: from sparsity to geometry and linear regions. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 200\u2013218. Springer (2023)","DOI":"10.1007\/978-3-031-33271-5_14"},{"key":"9_CR10","unstructured":"Chen, J., et al.: Minigpt-v2: large language model as a unified interface for vision-language multi-task learning. arXiv preprint arXiv:2310.09478 (2023)"},{"key":"9_CR11","first-page":"24235","volume":"34","author":"A Chmiela","year":"2021","unstructured":"Chmiela, A., Khalil, E., Gleixner, A., Lodi, A., Pokutta, S.: Learning to schedule heuristics in branch and bound. Adv. Neural. Inf. Process. Syst. 34, 24235\u201324246 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-13520-0_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B Dilkina","year":"2010","unstructured":"Dilkina, B., Gomes, C.P.: Solving connected subgraph problems in wildlife conservation. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 102\u2013116. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13520-0_14"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-01929-6_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B Dilkina","year":"2009","unstructured":"Dilkina, B., Gomes, C.P., Malitsky, Y., Sabharwal, A., Sellmann, M.: Backdoors to combinatorial optimization: feasibility and optimality. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 56\u201370. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01929-6_6"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Ding, J.Y., et al.: Accelerating primal solution findings for mixed integer programs based on solution prediction. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a034, pp. 1452\u20131459 (2020)","DOI":"10.1609\/aaai.v34i02.5503"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 439\u2013485 (2005)","DOI":"10.4007\/annals.2005.162.439"},{"key":"9_CR16","unstructured":"Drakulic, D., Michel, S., Andreoli, J.M.: Goal: a generalist combinatorial optimization agent learner. arXiv e-prints pp. arXiv-2406 (2024)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Ferber, A., Song, J., Dilkina, B., Yue, Y.: Learning pseudo-backdoors for mixed integer programs. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 91\u2013102. Springer (2022)","DOI":"10.1007\/978-3-031-08011-1_8"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Monaci, M.: Backdoor branching. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 183\u2013191. Springer (2011)","DOI":"10.1007\/978-3-642-20807-2_15"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10479-005-3446-x","volume":"139","author":"CA Floudas","year":"2005","unstructured":"Floudas, C.A., Lin, X.: Mixed integer linear programming in process scheduling: modeling, algorithms, and applications. Ann. Oper. Res. 139, 131\u2013162 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9_CR20","unstructured":"Gasse, M., et al.: The machine learning for combinatorial optimization competition (ML4CO): results and insights. In: NeurIPS 2021 Competitions and Demonstrations Track, pp. 220\u2013231. PMLR (2022)"},{"key":"9_CR21","unstructured":"Gasse, M., Ch\u00e9telat, D., Ferroni, N., Charlin, L., Lodi, A.: Exact combinatorial optimization with graph convolutional neural networks. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"9_CR22","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2024). https:\/\/www.gurobi.com"},{"key":"9_CR23","unstructured":"Han, Q., et al.: A GNN-guided predict-and-search framework for mixed-integer linear programming. arXiv preprint arXiv:2302.05636 (2023)"},{"key":"9_CR24","unstructured":"He, H., Daume\u00a0III, H., Eisner, J.M.: Learning to search in branch and bound algorithms. In: Advances in Neural Information Processing Systems, vol. 27 (2014)"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s12532-021-00209-7","volume":"14","author":"G Hendel","year":"2022","unstructured":"Hendel, G.: Adaptive large neighborhood search for mixed integer programming. Math. Program. Comput. 14, 185\u2013221 (2022)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1007\/s10479-023-05508-x","volume":"339","author":"A Hosny","year":"2024","unstructured":"Hosny, A., Reda, S.: Automatic MILP solver configuration by learning problem similarities. Ann. Oper. Res. 339(1), 909\u2013936 (2024)","journal-title":"Ann. Oper. Res."},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Huang, T., Dilkina, B.: Enhancing seismic resilience of water pipe networks. In: Proceedings of the 3rd ACM SIGCAS Conference on Computing and Sustainable Societies, pp. 44\u201352 (2020)","DOI":"10.1145\/3378393.3402246"},{"key":"9_CR28","unstructured":"Huang, T., Ferber, A.M., Tian, Y., Dilkina, B., Steiner, B.: Searching large neighborhoods for integer linear programs with contrastive learning. In: International Conference on Machine Learning, pp. 13869\u201313890. PMLR (2023)"},{"key":"9_CR29","unstructured":"Huang, T., Ferber, A.M., Zharmagambetov, A., Tian, Y., Dilkina, B.: Contrastive predict-and-search for mixed integer linear programs. In: International Conference on Machine Learning. PMLR (2024)"},{"key":"9_CR30","unstructured":"Huang, W., Huang, T., Ferber, A.M., Dilkina, B.: Distributional MIPLIB: a multi-domain library for advancing ml-guided milp methods. arXiv preprint arXiv:2406.06954 (2024)"},{"key":"9_CR31","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC\u2013instance-specific algorithm configuration. In: ECAI 2010, pp. 751\u2013756. IOS Press (2010)"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Khalil, E., Le\u00a0Bodic, P., Song, L., Nemhauser, G., Dilkina, B.: Learning to branch in mixed integer programming. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a030 (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Dilkina, B., Nemhauser, G.L., Ahmed, S., Shao, Y.: Learning to run heuristics in tree search. In: IJCAI, pp. 659\u2013666 (2017)","DOI":"10.24963\/ijcai.2017\/92"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Morris, C., Lodi, A.: MIP-GNN: a data-driven framework for guiding combinatorial solvers. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a036, pp. 10219\u201310227 (2022)","DOI":"10.1609\/aaai.v36i9.21262"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Vaezipoor, P., Dilkina, B.: Finding backdoors to integer programs: a Monte Carlo tree search framework. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a036, pp. 3786\u20133795 (2022)","DOI":"10.1609\/aaai.v36i4.20293"},{"key":"9_CR36","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"9_CR37","first-page":"32000","volume":"35","author":"AG Labassi","year":"2022","unstructured":"Labassi, A.G., Ch\u00e9telat, D., Lodi, A.: Learning to compare nodes in branch and bound with graph neural networks. Adv. Neural. Inf. Process. Syst. 35, 32000\u201332010 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"9_CR38","unstructured":"Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. Springer (2010)"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proceedings of the 2nd ACM Conference on Electronic Commerce, pp. 66\u201376 (2000)","DOI":"10.1145\/352871.352879"},{"key":"9_CR40","unstructured":"Li, S., Kulkarni, J., Menache, I., Wu, C., Li, B.: Towards foundation models for mixed integer linear programming. arXiv preprint arXiv:2410.08288 (2024)"},{"key":"9_CR41","unstructured":"Lin, J., Xu, M., Xiong, Z., Wang, H.: Cambranch: contrastive learning with augmented MILPs for branching. arXiv preprint arXiv:2402.03647 (2024)"},{"issue":"54","key":"9_CR42","first-page":"1","volume":"23","author":"M Lindauer","year":"2022","unstructured":"Lindauer, M., et al.: Smac3: a versatile Bayesian optimization package for hyperparameter optimization. J. Mach. Learn. Res. 23(54), 1\u20139 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Liu, S., Johns, E., Davison, A.J.: End-to-end multi-task learning with attention. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 1871\u20131880 (2019)","DOI":"10.1109\/CVPR.2019.00197"},{"key":"9_CR44","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25, 207\u2013236 (2017)","journal-title":"TOP"},{"key":"9_CR45","unstructured":"Nair, V., et al.: Solving mixed integer programs using neural networks. arXiv preprint arXiv:2012.13349 (2020)"},{"key":"9_CR46","unstructured":"Oord, A.V.D., Li, Y., Vinyals, O.: Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748 (2018)"},{"key":"9_CR47","unstructured":"Paulus, M.B., Zarpellon, G., Krause, A., Charlin, L., Maddison, C.: Learning to cut by looking ahead: cutting plane selection via imitation learning. In: International Conference on Machine Learning, pp. 17584\u201317600. PMLR (2022)"},{"issue":"3\u20134","key":"9_CR48","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","volume":"1","author":"I Pohl","year":"1970","unstructured":"Pohl, I.: Heuristic search viewed as path finding in a graph. Artif. Intell. 1(3\u20134), 193\u2013204 (1970)","journal-title":"Artif. Intell."},{"key":"9_CR49","doi-asserted-by":"crossref","unstructured":"Scavuzzo, L., Aardal, K., Lodi, A., Yorke-Smith, N.: Machine learning augmented branch and bound for mixed integer linear programming. Math. Program. 1\u201344 (2024)","DOI":"10.1007\/s10107-024-02130-y"},{"key":"9_CR50","unstructured":"Song, J., Lanka, R., Yue, Y., Dilkina, B.: A general large neighborhood search framework for solving integer programs. In: Annual Conference on Neural Information Processing Systems (NeurIPS) (2020)"},{"key":"9_CR51","unstructured":"Song, J., Lanka, R., Zhao, A., Bhatnagar, A., Yue, Y., Ono, M.: Learning to search via retrospective imitation. arXiv preprint arXiv:1804.00846 (2018)"},{"key":"9_CR52","unstructured":"Tang, Y., Agrawal, S., Faenza, Y.: Reinforcement learning for integer programming: learning to cut. In: International Conference on Machine Learning, pp. 9367\u20139376. PMLR (2020)"},{"key":"9_CR53","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/0206038","volume":"6","author":"RE Tarjan","year":"1977","unstructured":"Tarjan, R.E., Trojanowski, A.E.: Finding a maximum independent set. SIAM J. Comput. 6, 537\u2013546 (1977)","journal-title":"SIAM J. Comput."},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Tong, J., Cai, J., Serra, T.: Optimization over trained neural networks: taking a relaxing walk. In: International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 221\u2013233. Springer (2024)","DOI":"10.1007\/978-3-031-60599-4_14"},{"key":"9_CR55","unstructured":"Valentin, R., Ferrari, C., Scheurer, J., Amrollahi, A., Wendler, C., Paulus, M.B.: Instance-wise algorithm configuration with graph neural networks. arXiv preprint arXiv:2202.04910 (2022)"},{"key":"9_CR56","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: IJCAI, vol.\u00a03, pp. 1173\u20131178 (2003)"},{"key":"9_CR57","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Hydra-MIP: automated algorithm configuration and selection for mixed integer programming. In: RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI), pp. 16\u201330 (2011)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95973-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:01:17Z","timestamp":1751097677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95973-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031959721","9783031959738"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95973-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}