{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:28:09Z","timestamp":1775078889464,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"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":["J Supercomput"],"DOI":"10.1007\/s11227-026-08478-6","type":"journal-article","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:07:24Z","timestamp":1775070444000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PEBSI: Policy-efficient branching variable selection via reinforcement learning"],"prefix":"10.1007","volume":"82","author":[{"given":"Shuhan","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junbo","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daming","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenhui","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,1]]},"reference":[{"key":"8478_CR1","doi-asserted-by":"publisher","first-page":"4574","DOI":"10.1109\/TEM.2022.3208431","volume":"71","author":"Q Liu","year":"2022","unstructured":"Liu Q, Li X, Gao L, Fan J (2022) A multi-milp model collaborative optimization method for integrated process planning and scheduling problem. IEEE Trans Eng Manag 71:4574\u20134586","journal-title":"IEEE Trans Eng Manag"},{"key":"8478_CR2","doi-asserted-by":"crossref","unstructured":"Adrio G, Garc\u00eda-Villoria A, Juanpera M, Pastor R (2023) Milp model for the mid-term production planning in a chemical company with non-constant consumption of raw materials. An industrial application. Computers & Chemical Engineering 177:108361","DOI":"10.1016\/j.compchemeng.2023.108361"},{"key":"8478_CR3","doi-asserted-by":"crossref","unstructured":"Bazirha M (2023) A novel milp formulation and an efficient heuristic for the vehicle routing problem with lunch break. Annals of Operations Research, 1\u201326","DOI":"10.1007\/s10479-023-05742-3"},{"key":"8478_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.conengprac.2022.105430","volume":"133","author":"G Marli\u00e8re","year":"2023","unstructured":"Marli\u00e8re G, Richard SS, Pellegrini P, Rodriguez J (2023) A conditional time-intervals formulation of the real-time railway traffic management problem. Control Eng Pract 133:105430","journal-title":"Control Eng Pract"},{"key":"8478_CR5","unstructured":"Eggers B (2016) Computers and intractability a guide to the theory of np completeness. https:\/\/api.semanticscholar.org\/CorpusID:124074750"},{"key":"8478_CR6","doi-asserted-by":"crossref","unstructured":"Lodi A (2013) The heuristic (dark) side of mip solvers. In: Hybrid Metaheuristics . https:\/\/api.semanticscholar.org\/CorpusID:28868684","DOI":"10.1007\/978-3-642-30671-6_10"},{"key":"8478_CR7","doi-asserted-by":"crossref","unstructured":"Achterberg T, Wunderling R (2013) Mixed integer programming: Analyzing 12 years of progress. https:\/\/api.semanticscholar.org\/CorpusID:59830161","DOI":"10.1007\/978-3-642-38189-8_18"},{"key":"8478_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_5","volume-title":"An Automatic Method for Solving Discrete Programming Problems","author":"AH Land","year":"2010","unstructured":"Land AH, Doig AG (2010) An Automatic Method for Solving Discrete Programming Problems. Berlin Heidelberg, Boston"},{"issue":"1","key":"8478_CR9","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 (2005) Branching rules revisited. Oper Res Lett 33(1):42\u201354","journal-title":"Oper Res Lett"},{"key":"8478_CR10","unstructured":"Applegate D, Bixby R, Chvatal V, Cook B (1995) Finding Cuts in the TSP (A preliminary report). Center for Discrete Mathematics & Theoretical Computer Science"},{"key":"8478_CR11","unstructured":"Nair V, Bartunov S, Gimeno F, Von\u00a0Glehn I, Lichocki P, Lobov I, O\u2019Donoghue B, Sonnerat N, Tjandraatmadja C, Wang P, et al (2020) Solving mixed integer programs using neural networks. arXiv preprint arXiv:2012.13349"},{"key":"8478_CR12","first-page":"40","volume":"32","author":"M Gasse","year":"2019","unstructured":"Gasse M, Ch\u00e9telat D, Ferroni N, Charlin L, Lodi A (2019) Exact combinatorial optimization with graph convolutional neural networks. Adv Neural Inf Process Syst 32:40","journal-title":"Adv Neural Inf Process Syst"},{"key":"8478_CR13","doi-asserted-by":"crossref","unstructured":"Khalil EB, Morris C, Lodi A (2022) Mip-gnn: A data-driven framework for guiding combinatorial solvers. In: Proceedings of the AAAI Conference on Artificial Intelligence, 36, 10219\u201310227","DOI":"10.1609\/aaai.v36i9.21262"},{"key":"8478_CR14","doi-asserted-by":"crossref","unstructured":"Khalil E, Le\u00a0Bodic P, Song L, Nemhauser G, Dilkina B (2016) Learning to branch in mixed integer programming. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"8478_CR15","unstructured":"Hansknecht C, Joormann I, Stiller S (2018) Cuts, primal heuristics, and learning to branch for the time-dependent traveling salesman problem. arXiv preprint arXiv:1805.01415"},{"issue":"1","key":"8478_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez AM, Louveaux Q, Wehenkel L (2017) A machine learning-based approximation of strong branching. INFORMS J Comput 29(1):185\u2013195","journal-title":"INFORMS J Comput"},{"key":"8478_CR17","first-page":"18087","volume":"33","author":"P Gupta","year":"2020","unstructured":"Gupta P, Gasse M, Khalil E, Mudigonda P, Lodi A, Bengio Y (2020) Hybrid models for learning to branch. Adv Neural Inf Process Syst 33:18087\u201318097","journal-title":"Adv Neural Inf Process Syst"},{"key":"8478_CR18","unstructured":"Berthold T, Gamrath G, Salvagnin D (2019) Exploiting dual degeneracy in branching. https:\/\/api.semanticscholar.org\/CorpusID:149449386"},{"key":"8478_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s13675-020-00130-z","volume":"8","author":"G Gamrath","year":"2020","unstructured":"Gamrath G, Berthold T, Salvagnin D (2020) An exploratory computational analysis of dual degeneracy in mixed-integer programming. Eur J Comput Optim 8:241\u2013261","journal-title":"Eur J Comput Optim"},{"key":"8478_CR20","unstructured":"Parsonson CWF, Laterre A, Barrett TD (2022) Reinforcement learning for branch-and-bound optimisation using retrospective trajectories. In: AAAI Conference on Artificial Intelligence . https:\/\/api.semanticscholar.org\/CorpusID:249192146"},{"key":"8478_CR21","unstructured":"Sun H, Chen W, Li H, Song L (2020) Improving learning to branch via reinforcement learning. https:\/\/api.semanticscholar.org\/CorpusID:235602520"},{"key":"8478_CR22","unstructured":"Qu Q, Li X, Zhou Y, Zeng J, Yuan M, Wang J, Lv J, Liu K, Mao K (2022) An improved reinforcement learning algorithm for learning to branch. ArXiv abs\/2201.06213"},{"key":"8478_CR23","unstructured":"Zhang C, Ouyang W, Yuan H, Gong L, Sun Y, Guo Z, Dong Z, Yan J (2024) Towards imitation learning to branch for MIP: A hybrid reinforcement learning based sample augmentation approach. In: The Twelfth International Conference on Learning Representations . https:\/\/openreview.net\/forum?id=NdcQQ82mfy"},{"key":"8478_CR24","doi-asserted-by":"crossref","unstructured":"Zhang T, Banitalebi-Dehkordi A, Zhang Y (2022) Deep reinforcement learning for exact combinatorial optimization: Learning to branch. 2022 26th International Conference on Pattern Recognition (ICPR), 3105\u20133111","DOI":"10.1109\/ICPR56361.2022.9956256"},{"key":"8478_CR25","doi-asserted-by":"crossref","unstructured":"Huang Z, Chen W, Zhang W, Shi C, Liu F, Zhen H-L, Yuan M, Hao J, Yu Y, Wang J (2022) Branch ranking for efficient mixed-integer programming via offline ranking-based policy learning. In: ECML\/PKDD . https:\/\/api.semanticscholar.org\/CorpusID:252518363","DOI":"10.1007\/978-3-031-26419-1_23"},{"key":"8478_CR26","doi-asserted-by":"crossref","unstructured":"Etheve M, Al\u00e8s Z, Bissuel C, Juan O, Kedad-Sidhoum S (2020) Reinforcement learning for variable selection in a branch and bound algorithm. ArXiv abs\/2005.10026","DOI":"10.1007\/978-3-030-58942-4_12"},{"key":"8478_CR27","unstructured":"Scavuzzo L, Chen F, Ch\u2019etelat D, Gasse M, Lodi A, Yorke-Smith N, Aardal KI (2022) Learning to branch with tree mdps. ArXiv abs\/2205.11107"},{"key":"8478_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd SP, Vandenberghe L (2004) Convex Optimization. Cambridge University Press, Cambridge"},{"key":"8478_CR29","doi-asserted-by":"crossref","unstructured":"Achterberg T (2007) Constraint integer programming","DOI":"10.1007\/978-3-540-72397-4_3"},{"key":"8478_CR30","doi-asserted-by":"crossref","unstructured":"Achterberg T, Berthold T (2009) Hybrid branching. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings 6, pp. 309\u2013311. Springer","DOI":"10.1007\/978-3-642-01929-6_23"},{"key":"8478_CR31","doi-asserted-by":"crossref","unstructured":"Zarpellon G, Jo J, Lodi A, Bengio Y (2021) Parameterizing branch-and-bound search trees to learn branching policies. In: Proceedings of the Aaai Conference on Artificial Intelligence, vol. 35, pp. 3931\u20133939","DOI":"10.1609\/aaai.v35i5.16512"},{"key":"8478_CR32","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/TNN.1998.712192","volume":"9","author":"RS Sutton","year":"1998","unstructured":"Sutton RS, Barto AG (1998) Reinforcement learning: an introduction. IEEE Trans Neural Netw 9:1054\u20131054","journal-title":"IEEE Trans Neural Netw"},{"issue":"3","key":"8478_CR33","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin RJ (1965) A tree-search algorithm for mixed integer programming problems. Comput J 8(3):250\u2013255","journal-title":"Comput J"},{"key":"8478_CR34","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M B\u00e9nichou","year":"1971","unstructured":"B\u00e9nichou M, Gauthier J-M, Girodet P, Hentges G, Ribi\u00e8re G, Vincent O (1971) Experiments in mixed-integer linear programming. Math Prog 1:76\u201394","journal-title":"Math Prog"},{"key":"8478_CR35","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Graves A, Antonoglou I, Wierstra D, Riedmiller MA (2013) Playing atari with deep reinforcement learning. ArXiv abs\/1312.5602"},{"key":"8478_CR36","unstructured":"Salimans T, Chen R (2018) Learning montezuma\u2019s revenge from a single demonstration. arXiv preprint arXiv:1812.03381"},{"key":"8478_CR37","unstructured":"Silver D, Hubert T, Schrittwieser J, Antonoglou I, Lai M, Guez A, Lanctot M, Sifre L, Kumaran D, Graepel T, Lillicrap TP, Simonyan K, Hassabis D (2017) Mastering chess and shogi by self-play with a general reinforcement learning algorithm. ArXiv abs\/1712.01815"},{"key":"8478_CR38","unstructured":"Schulman J, Wolski F, Dhariwal P, Radford A, Klimov O (2017) Proximal policy optimization algorithms. ArXiv abs\/1707.06347"},{"key":"8478_CR39","doi-asserted-by":"crossref","unstructured":"Yilmaz K, Yorke-Smith N (2021) A study of learning search approximation in mixed integer branch and bound: Node selection in scip. Ai 2(2), 150\u2013178","DOI":"10.3390\/ai2020010"},{"key":"8478_CR40","unstructured":"Bolusani S, Besan\u00e7on M, Bestuzheva K, Chmiela A, Dion\u00edsio J, Donkiewicz T, Doornmalen J, Eifler L, Ghannam M, Gleixner A, Graczyk C, Halbig K, Hedtke I, Hoen A, Hojny C, Hulst R, Kamp D, Koch T, Kofler K, Lentz J, Manns J, Mexi G, M\u00fchmer E, Pfetsch ME, Schl\u00f6sser F, Serrano F, Shinano Y, Turner M, Vigerske S, Weninger D, Xu L (2024) The SCIP Optimization Suite 9.0. Technical report, Optimization Online (February). https:\/\/optimization-online.org\/2024\/02\/the-scip-optimization-suite-9-0\/"},{"key":"8478_CR41","first-page":"45","volume":"32","author":"A Paszke","year":"2019","unstructured":"Paszke A, Gross S, Massa F, Lerer A, Bradbury J, Chanan G, Killeen T, Lin Z, Gimelshein N, Antiga L et al (2019) Pytorch: an imperative style, high-performance deep learning library. Adv Neural Inf Process Syst 32:45","journal-title":"Adv Neural Inf Process Syst"},{"key":"8478_CR42","unstructured":"Fey M, Lenssen JE (2019) Fast graph representation learning with pytorch geometric. arXiv preprint arXiv:1903.02428"},{"key":"8478_CR43","doi-asserted-by":"crossref","unstructured":"Maher S, Miltenberger M, Pedroso JP, Rehfeldt D, Schwarz R, Serrano F (2016) Pyscipopt: Mathematical programming in python with the scip optimization suite. In: Mathematical Software\u2013ICMS 2016: 5th International Conference, Berlin, Germany, July 11-14, 2016, Proceedings 5, pp. 301\u2013307 . Springer","DOI":"10.1007\/978-3-319-42432-3_37"},{"key":"8478_CR44","unstructured":"Prouvost A, Dumouchelle J, Scavuzzo L, Gasse M, Ch\u00e9telat D, Lodi A (2020) Ecole: A gym-like library for machine learning in combinatorial optimization solvers. In: Learning Meets Combinatorial Algorithms at NeurIPS2020. https:\/\/openreview.net\/forum?id=IVc9hqgibyB"},{"issue":"1","key":"8478_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville A (2004) The multidimensional 0\u20131 knapsack problem: an overview. Eur J Oper Res 155(1):1\u201321. https:\/\/doi.org\/10.1016\/S0377-2217(03)00274-1","journal-title":"Eur J Oper Res"},{"key":"8478_CR46","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/ijoc.1090.0344","volume":"22","author":"J Puchinger","year":"2010","unstructured":"Puchinger J, Raidl GR, Pferschy U (2010) The multidimensional knapsack problem: structure and algorithms. INFORMS J Comput 22:250\u2013265","journal-title":"INFORMS J Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08478-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08478-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08478-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:07:29Z","timestamp":1775070449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08478-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,1]]},"references-count":46,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["8478"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08478-6","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,1]]},"assertion":[{"value":"15 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"312"}}