{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T04:01:18Z","timestamp":1749355278856,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":42,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819665754","type":"print"},{"value":"9789819665761","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-981-96-6576-1_25","type":"book-chapter","created":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T05:38:30Z","timestamp":1749274710000},"page":"366-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["APS: An Adaptive Policy Switching Framework to\u00a0Improve the\u00a0Generalization of\u00a0Branching Policy"],"prefix":"10.1007","author":[{"given":"Ce","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dapeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyue","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,8]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Achterberg, T.: Constraint integer programming (2007)","DOI":"10.1007\/978-3-540-72397-4_3"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: Scip: solving constraint integer programs. Math. Program. Comput. 1, 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"25_CR3","unstructured":"Achterberg, T.: branch_relpscost.h file reference (Fri 21 June 2024). https:\/\/scipopt.org\/doc\/html\/branch__relpscost_8h.php. Accessed 13 July 2024"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"25_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: Miplib 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006)","journal-title":"Oper. Res. Lett."},{"key":"25_CR6","unstructured":"Barnhart, C., Laporte, G.: Handbooks in Operations Research and Management Science: Transportation. Elsevier, Amsterdam (2006)"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"ZL Chen","year":"2010","unstructured":"Chen, Z.L.: Integrated production and outbound distribution scheduling: review and extensions. Oper. Res. 58(1), 130\u2013148 (2010)","journal-title":"Oper. Res."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Etheve, M., Al\u00e8s, Z., Bissuel, C., Juan, O., Kedad-Sidhoum, S.: Reinforcement learning for variable selection in a branch and bound algorithm. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 176\u2013185. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-58942-4_12"},{"key":"25_CR10","unstructured":"Fujimoto, S., Meger, D., Precup, D.: Off-policy deep reinforcement learning without exploration. In: International Conference on Machine Learning, pp. 2052\u20132062. PMLR (2019)"},{"key":"25_CR11","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)"},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., et al.: Miplib 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021)","journal-title":"Math. Program. Comput."},{"key":"25_CR13","unstructured":"Goodfellow, I., et al.: Generative adversarial nets. In: Advances in Neural Information Processing Systems, vol. 27 (2014)"},{"key":"25_CR14","unstructured":"Gupta, P., Gasse, M., Khalil, E., Mudigonda, P., Lodi, A., Bengio, Y.: Hybrid models for learning to branch. In: Advances in Neural Information Processing Systems, vol. 33, pp. 18087\u201318097 (2020)"},{"key":"25_CR15","unstructured":"Haarnoja, T., Zhou, A., Abbeel, P., Levine, S.: Soft actor-critic: off-policy maximum entropy deep reinforcement learning with a stochastic actor. In: International Conference on Machine Learning, pp. 1861\u20131870. PMLR (2018)"},{"key":"25_CR16","unstructured":"Hafner, D., Pasukonis, J., Ba, J., Lillicrap, T.: Mastering diverse domains through world models. arXiv preprint arXiv:2301.04104 (2023)"},{"key":"25_CR17","unstructured":"Hansen, N., Su, H., Wang, X.: TD-MPC2: scalable, robust world models for continuous control. In: The Twelfth International Conference on Learning Representations (2024), https:\/\/openreview.net\/forum?id=Oxh5CstDJU"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., et al.: Miplib 2010: mixed integer programming library version 5. Math. Program. Comput. 3, 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"25_CR19","unstructured":"Kostrikov, I., Nair, A., Levine, S.: Offline reinforcement learning with implicit q-learning. In: International Conference on Learning Representations (2022). https:\/\/openreview.net\/forum?id=68n2s9ZJWF8"},{"key":"25_CR20","unstructured":"Kuang, Y., et al.: Rethinking branching on exact combinatorial optimization solver: the first deep symbolic discovery framework. In: The Twelfth International Conference on Learning Representations (2024)"},{"key":"25_CR21","unstructured":"Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. Springer, Cham (2010)"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Li, D., Lou, N., Zhang, B., Xu, Z., Fan, G.: Adaptive parameter sharing for multi-agent reinforcement learning. In: ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 6035\u20136039 (2024). https:\/\/doi.org\/10.1109\/ICASSP48485.2024.10447262","DOI":"10.1109\/ICASSP48485.2024.10447262"},{"key":"25_CR23","unstructured":"Li, D., Xu, Z., Zhang, B., Zhou, G., Zhang, Z., Fan, G.: From explicit communication to tacit cooperation: a novel paradigm for cooperative marl. In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems. AAMAS \u201924, pp. 2360\u20132362. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2024)"},{"issue":"2","key":"25_CR24","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"JT Linderoth","year":"1999","unstructured":"Linderoth, J.T., Savelsbergh, M.W.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11(2), 173\u2013187 (1999)","journal-title":"INFORMS J. Comput."},{"key":"25_CR25","unstructured":"Liu, H., Kuang, Y., Wang, J., Li, X., Zhang, Y., Wu, F.: Promoting generalization for exact solvers via adversarial instance augmentation. arXiv preprint arXiv:2310.14161 (2023)"},{"issue":"4","key":"25_CR26","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Parsonson, C.W., Laterre, A., Barrett, T.D.: Reinforcement learning for branch-and-bound optimisation using retrospective trajectories. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a037, pp. 4061\u20134069 (2023)","DOI":"10.1609\/aaai.v37i4.25521"},{"key":"25_CR28","unstructured":"Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming, vol.\u00a0149. Springer, Cham (2006)"},{"issue":"1\u20132","key":"25_CR29","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0377-0427(00)00433-7","volume":"124","author":"FA Potra","year":"2000","unstructured":"Potra, F.A., Wright, S.J.: Interior-point methods. J. Comput. Appl. Math. 124(1\u20132), 281\u2013302 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Qiao, F., Zhao, L., Peng, X.: Learning to learn single domain generalization. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 12556\u201312565 (2020)","DOI":"10.1109\/CVPR42600.2020.01257"},{"issue":"178","key":"25_CR31","first-page":"1","volume":"21","author":"T Rashid","year":"2020","unstructured":"Rashid, T., Samvelyan, M., De Witt, C.S., Farquhar, G., Foerster, J., Whiteson, S.: Monotonic value function factorisation for deep multi-agent reinforcement learning. J. Mach. Learn. Res. 21(178), 1\u201351 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"25_CR32","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. arXiv preprint arXiv:2402.05501 (2024)","DOI":"10.1007\/s10107-024-02130-y"},{"key":"25_CR33","unstructured":"Scavuzzo, L., et al.: Learning to branch with tree MDPs. In: Advances in Neural Information Processing Systems, vol. 35, pp. 18514\u201318526 (2022)"},{"key":"25_CR34","unstructured":"Schulman, J.: Trust region policy optimization. CoRR abs\/1502.05477 (2015)"},{"key":"25_CR35","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)"},{"key":"25_CR36","unstructured":"Tolstikhin, I., Bousquet, O., Gelly, S., Schoelkopf, B.: Wasserstein auto-encoders. In: International Conference on Learning Representations (2018). https:\/\/openreview.net\/forum?id=HkL7n1-0b"},{"key":"25_CR37","unstructured":"Volpi, R., Namkoong, H., Sener, O., Duchi, J.C., Murino, V., Savarese, S.: Generalizing to unseen domains via adversarial data augmentation. In: Advances in Neural Information Processing Systems, vol. 31 (2018)"},{"issue":"8","key":"25_CR38","first-page":"8052","volume":"35","author":"J Wang","year":"2022","unstructured":"Wang, J., et al.: Generalizing to unseen domains: a survey on domain generalization. IEEE Trans. Knowl. Data Eng. 35(8), 8052\u20138072 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1\u20133","key":"25_CR39","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0169-7439(87)80084-9","volume":"2","author":"S Wold","year":"1987","unstructured":"Wold, S., Esbensen, K., Geladi, P.: Principal component analysis. Chemom. Intell. Lab. Syst. 2(1\u20133), 37\u201352 (1987)","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"25_CR40","doi-asserted-by":"crossref","unstructured":"Zarpellon, G., Jo, J., Lodi, A., Bengio, Y.: Parameterizing branch-and-bound search trees to learn branching policies. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a035, pp. 3931\u20133939 (2021)","DOI":"10.1609\/aaai.v35i5.16512"},{"key":"25_CR41","unstructured":"Zhang, B., et al.: Sequential asynchronous action coordination in multi-agent systems: a Stackelberg decision transformer approach. In: Forty-First International Conference on Machine Learning (2024). https:\/\/openreview.net\/forum?id=M3qRRkOuTN"},{"key":"25_CR42","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.neucom.2022.11.024","volume":"519","author":"J Zhang","year":"2023","unstructured":"Zhang, J., et al.: A survey for solving mixed integer programming via machine learning. Neurocomputing 519, 205\u2013217 (2023)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-6576-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T05:38:49Z","timestamp":1749274729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-6576-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819665754","9789819665761"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-6576-1_25","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":"8 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2024.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}