{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:15Z","timestamp":1740182415347,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100019217","name":"IVADO","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100019217","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00336-6","type":"journal-article","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T19:01:41Z","timestamp":1719860501000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["One-Shot Learning for MIPs with SOS1 Constraints"],"prefix":"10.1007","volume":"5","author":[{"given":"Charly","family":"Robinson La Rocca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00c3\u00a7ois","family":"Cordeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emma","family":"Frejinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,1]]},"reference":[{"issue":"3","key":"336_CR1","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s00291-020-00604-x","volume":"43","author":"Y Sun","year":"2021","unstructured":"Sun Y, Ernst A, Li X et al (2021) Generalization of machine learning for problem reduction: a case study on travelling salesman problems. OR Spectrum 43(3):607\u2013633. https:\/\/doi.org\/10.1007\/s00291-020-00604-x","journal-title":"OR Spectrum"},{"issue":"2","key":"336_CR2","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1287\/ijoc.2020.0976","volume":"33","author":"AS Xavier","year":"2021","unstructured":"Xavier AS, Qiu F, Ahmed S (2021) Learning to solve-large scale security-constrained unit commitment problems. INFORMS J Comput 33(2):739\u2013756. https:\/\/doi.org\/10.1287\/ijoc.2020.0976","journal-title":"INFORMS J Comput"},{"issue":"2","key":"336_CR3","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.ejor.2017.11.054","volume":"270","author":"T Fischer","year":"2018","unstructured":"Fischer T, Krauss C (2018) Deep learning with long short-term memory networks for financial market predictions. Eur J Oper Res 270(2):654\u2013669. https:\/\/doi.org\/10.1016\/j.ejor.2017.11.054","journal-title":"Eur J Oper Res"},{"key":"336_CR4","unstructured":"Wang YE, Wei GY, Brooks D (2019) Benchmarking TPU, GPU, and CPU platforms for deep learning. arXiv preprint arXiv:1907.10701 [cs.LG]"},{"key":"336_CR5","first-page":"8026","volume":"32","author":"A Paszke","year":"2019","unstructured":"Paszke A, Gross S, Massa F et al (2019) Pytorch: an imperative style, high-performance deep learning library. Adv Neural Inf Process Syst 32:8026\u20138037","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"336_CR6","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 (2021) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur J Oper Res 290(2):405\u2013421. https:\/\/doi.org\/10.1016\/j.ejor.2020.07.063","journal-title":"Eur J Oper Res"},{"key":"336_CR7","unstructured":"Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. In: Advances in Neural Information Processing Systems (vol. 28). pp 2692\u20132700"},{"key":"336_CR8","unstructured":"Xu L, Hutter F, Hoos HH et\u00a0al (2011) Hydra-MIP: automated algorithm configuration and selection for mixed integer programming. 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"},{"issue":"2","key":"336_CR9","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 (2017) On learning and branching: a survey. TOP 25(2):207\u2013236. https:\/\/doi.org\/10.1007\/s11750-017-0451-6","journal-title":"TOP"},{"key":"336_CR10","first-page":"447","volume-title":"Proceedings of the Fifth International Conference on Operational Research","author":"E Beale","year":"1970","unstructured":"Beale E, Tomlin J (1970) Special facilities in a general mathematical programming system for non\u2013convex problems using ordered sets of variables. In: Lawrence J (ed) Proceedings of the Fifth International Conference on Operational Research. Tavistock Publications, London, pp 447\u2013454"},{"issue":"1","key":"336_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna E, Rothberg E, Pape CL (2005) Exploring relaxation induced neighborhoods to improve MIP solutions. Math Program 102(1):71\u201390. https:\/\/doi.org\/10.1007\/s10107-004-0518-7","journal-title":"Math Program"},{"issue":"1","key":"336_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-013-0060-9","volume":"6","author":"T Berthold","year":"2014","unstructured":"Berthold T (2014) RENS: the optimal rounding. Math Program Comput 6(1):33\u201354. https:\/\/doi.org\/10.1007\/s12532-013-0060-9","journal-title":"Math Program Comput"},{"key":"336_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/9781119606475","volume-title":"Integer programming","author":"LA Wolsey","year":"2020","unstructured":"Wolsey LA (2020) Integer programming. John Wiley & Sons"},{"key":"336_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget JF (eds) Principles and Practice of Constraint Programming \u2014 CP98. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp 417\u2013431. https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"336_CR15","unstructured":"IBM. IBM CPLEX User\u2019s manual for CPLEX. https:\/\/www.ibm.com\/docs\/en\/icos\/22.1.1?topic=optimizers-users-manual-cplex. Accessed 18 June 2024"},{"key":"336_CR16","unstructured":"Gurobi. Gurobi optimization documentation. https:\/\/www.gurobi.com\/documentation\/. Accessed 18 June 2024"},{"key":"336_CR17","doi-asserted-by":"publisher","DOI":"10.1145\/3585516","author":"K Bestuzheva","year":"2023","unstructured":"Bestuzheva K, Besan\u00e7on M, Chen WK et al (2023) Enabling research through the SCIP optimization suite 8.0. ACM Trans Math Softw. https:\/\/doi.org\/10.1145\/3585516","journal-title":"ACM Trans Math Softw"},{"issue":"3","key":"336_CR18","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land AH, Doig AG (1960) An automatic method of solving discrete programming problems. Econometrica 28(3):497\u2013520","journal-title":"Econometrica"},{"issue":"4","key":"336_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10732-017-9336-y","volume":"23","author":"S Hanafi","year":"2017","unstructured":"Hanafi S, Todosijevi\u0107 R (2017) Mathematical programming based heuristics for the 0\u20131 MIP: a survey. J Heuristics 23(4):165\u2013206. https:\/\/doi.org\/10.1007\/s10732-017-9336-y","journal-title":"J Heuristics"},{"issue":"1","key":"336_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti M, Glover F, Lodi A (2005) The feasibility pump. Math Program 104(1):91\u2013104. https:\/\/doi.org\/10.1007\/s10107-004-0570-3","journal-title":"Math Program"},{"issue":"1","key":"336_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.disopt.2006.10.001","volume":"4","author":"L Bertacco","year":"2007","unstructured":"Bertacco L, Fischetti M, Lodi A (2007) A feasibility pump heuristic for general mixed-integer problems. Discret Optim 4(1):63\u201376. https:\/\/doi.org\/10.1016\/j.disopt.2006.10.001","journal-title":"Discret Optim"},{"issue":"1","key":"336_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg T, Berthold T (2007) Improving the feasibility pump. Discret Optim 4(1):77\u201386. https:\/\/doi.org\/10.1016\/j.disopt.2006.10.004","journal-title":"Discret Optim"},{"issue":"4","key":"336_CR23","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472. https:\/\/doi.org\/10.1287\/trsc.1050.0135","journal-title":"Transp Sci"},{"key":"336_CR24","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-91086-4_4","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2019","unstructured":"Pisinger D, Ropke S (2019) Large neighborhood search. In: Gendreau M, Potvin JY (eds) Handbook of Metaheuristics. International Series in Operations Research & Management Science. Springer International Publishing, Cham, pp 99\u2013127. https:\/\/doi.org\/10.1007\/978-3-319-91086-4_4"},{"issue":"1","key":"336_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program 98(1):23\u201347. https:\/\/doi.org\/10.1007\/s10107-003-0395-5","journal-title":"Math Program"},{"issue":"6","key":"336_CR26","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s10732-014-9266-x","volume":"20","author":"M Fischetti","year":"2014","unstructured":"Fischetti M, Monaci M (2014) Proximity search for 0\u20131 mixed-integer convex programming. J Heuristics 20(6):709\u2013731. https:\/\/doi.org\/10.1007\/s10732-014-9266-x","journal-title":"J Heuristics"},{"issue":"2","key":"336_CR27","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s12532-021-00209-7","volume":"14","author":"G Hendel","year":"2022","unstructured":"Hendel G (2022) Adaptive large neighborhood search for mixed integer programming. Math Program Comput 14(2):185\u2013221. https:\/\/doi.org\/10.1007\/s12532-021-00209-7","journal-title":"Math Program Comput"},{"key":"336_CR28","unstructured":"Berthold T (2006) Primal heuristics for mixed integer programs. PhD thesis, Zuse Institute Berlin (ZIB)"},{"issue":"2","key":"336_CR29","doi-asserted-by":"publisher","first-page":"131","DOI":"10.2298\/YJOR140417027L","volume":"26","author":"J Lazi\u0107","year":"2016","unstructured":"Lazi\u0107 J, Todosijevi\u0107 R, Hanafi S et al (2016) Variable and single neighbourhood diving for MIP feasibility. Yugoslav Journal of Operations Research 26(2):131\u2013157. https:\/\/doi.org\/10.2298\/YJOR140417027L","journal-title":"Yugoslav Journal of Operations Research"},{"key":"336_CR30","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-29210-1_12","volume-title":"Operations Research Proceedings 2011","author":"T Achterberg","year":"2012","unstructured":"Achterberg T, Berthold T, Hendel G (2012) Rounding and propagation heuristics for mixed integer programming. In: Klatte D, L\u00fcthi HJ, Schmedders K (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg, pp 71\u201376. https:\/\/doi.org\/10.1007\/978-3-642-29210-1_12"},{"issue":"2","key":"336_CR31","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10589-018-0042-y","volume":"72","author":"C Neumann","year":"2019","unstructured":"Neumann C, Stein O, Sudermann-Merx N (2019) A feasible rounding approach for mixed-integer optimization problems. Comput Optim Appl 72(2):309\u2013337. https:\/\/doi.org\/10.1007\/s10589-018-0042-y","journal-title":"Comput Optim Appl"},{"issue":"5","key":"336_CR32","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10732-009-9114-6","volume":"16","author":"C Wallace","year":"2010","unstructured":"Wallace C (2010) ZI round, a MIP rounding heuristic. Journal of Heuristics 16(5):715\u2013722. https:\/\/doi.org\/10.1007\/s10732-009-9114-6","journal-title":"Journal of Heuristics"},{"issue":"2","key":"336_CR33","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.disopt.2010.07.001","volume":"8","author":"A Gilpin","year":"2011","unstructured":"Gilpin A, Sandholm T (2011) Information-theoretic approaches to branching in search. Discret Optim 8(2):147\u2013159. https:\/\/doi.org\/10.1016\/j.disopt.2010.07.001","journal-title":"Discret Optim"},{"issue":"4","key":"336_CR34","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12532-009-0009-1","volume":"1","author":"FK Karzan","year":"2009","unstructured":"Karzan FK, Nemhauser GL, Savelsbergh MW (2009) Information-based branching schemes for binary linear mixed integer problems. Math Program Comput 1(4):249\u2013293. https:\/\/doi.org\/10.1007\/s12532-009-0009-1","journal-title":"Math Program Comput"},{"issue":"3","key":"336_CR35","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27(3):379\u2013423","journal-title":"Bell Syst Tech J"},{"key":"336_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-13520-0_8","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Berthold","year":"2010","unstructured":"Berthold T, Feydy T, Stuckey PJ (2010) Rapid learning for binary programs. In: Lodi A, Milano M, Toth P (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp 51\u201355. https:\/\/doi.org\/10.1007\/978-3-642-13520-0_8"},{"key":"336_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-19212-9_5","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"T Berthold","year":"2019","unstructured":"Berthold T, Stuckey PJ, Witzig J (2019) Local rapid learning for integer programs. In: Rousseau LM, Stergiou K (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Lecture Notes in Computer Science. Springer International Publishing, Cham, pp 67\u201383. https:\/\/doi.org\/10.1007\/978-3-030-19212-9_5"},{"key":"336_CR38","first-page":"24235","volume-title":"Advances in Neural Information Processing Systems","author":"A Chmiela","year":"2021","unstructured":"Chmiela A, Khalil E, Gleixner A et al (2021) Learning to schedule heuristics in branch and bound. Advances in Neural Information Processing Systems, vol 34. Curran Associates, Inc., pp 24235\u201324246"},{"key":"336_CR39","unstructured":"Gasse M, Ch\u00e9telat D, Ferroni N, et\u00a0al (2019) Exact combinatorial optimization with graph convolutional neural networks. In: Advances in Neural Information Processing Systems (vol. 32). pp 15580\u201315592"},{"key":"336_CR40","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10080","author":"E Khalil","year":"2016","unstructured":"Khalil E, Bodic PL, Song L et al (2016) Learning to branch in mixed integer programming. Proceedings of the AAAI Conference on Artificial Intelligence. https:\/\/doi.org\/10.1609\/aaai.v30i1.10080","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"336_CR41","first-page":"9367","volume-title":"International Conference on Machine Learning","author":"Y Tang","year":"2020","unstructured":"Tang Y, Agrawal S, Faenza Y (2020) Reinforcement learning for integer programming: learning to cut. International Conference on Machine Learning. PMLR, pp 9367\u20139376"},{"issue":"3","key":"336_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01588-5","volume":"14","author":"WL Hamilton","year":"2020","unstructured":"Hamilton WL (2020) Graph representation learning. Synthesis Lectures on Artifical Intelligence and Machine Learning 14(3):1\u2013159","journal-title":"Synthesis Lectures on Artifical Intelligence and Machine Learning"},{"issue":"02","key":"336_CR43","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1609\/aaai.v34i02.5503","volume":"34","author":"JY Ding","year":"2020","unstructured":"Ding JY, Zhang C, Shen L et al (2020) Accelerating primal solution findings for mixed integer programs based on solution prediction. Proceedings of the AAAI Conference on Artificial Intelligence 34(02):1452\u20131459. https:\/\/doi.org\/10.1609\/aaai.v34i02.5503","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"336_CR44","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 (vol. 36, no. 9). pp 10219\u201310227","DOI":"10.1609\/aaai.v36i9.21262"},{"key":"336_CR45","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/ICARCV57592.2022.10004252","volume-title":"2022 17th International Conference on Control, Automation, Robotics and Vision (ICARCV)","author":"L Huang","year":"2022","unstructured":"Huang L, Chen X, Huo W et al (2022) Improving primal heuristics for mixed integer programming problems based on problem reduction: a learning-based approach. 2022 17th International Conference on Control, Automation, Robotics and Vision (ICARCV). IEEE, pp 181\u2013186"},{"key":"336_CR46","doi-asserted-by":"publisher","first-page":"104781","DOI":"10.1016\/j.cor.2019.104781","volume":"113","author":"A Hottung","year":"2020","unstructured":"Hottung A, Tanaka S, Tierney K (2020) Deep learning assisted heuristic tree search for the container pre-marshalling problem. Comput Oper Res 113:104781. https:\/\/doi.org\/10.1016\/j.cor.2019.104781","journal-title":"Comput Oper Res"},{"key":"336_CR47","doi-asserted-by":"publisher","first-page":"580607","DOI":"10.3389\/frai.2020.580607","volume":"3","author":"J Toenshoff","year":"2021","unstructured":"Toenshoff J, Ritzert M, Wolf H et al (2021) Graph neural networks for maximum constraint satisfaction. Front Artif Intell 3:580607. https:\/\/doi.org\/10.3389\/frai.2020.580607","journal-title":"Front Artif Intell"},{"issue":"3","key":"336_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3386252","volume":"53","author":"Y Wang","year":"2021","unstructured":"Wang Y, Yao Q, Kwok JT et al (2021) Generalizing from a few examples: a survey on few-shot learning. ACM Comput Surv 53(3):1. https:\/\/doi.org\/10.1145\/3386252","journal-title":"ACM Comput Surv"},{"key":"336_CR49","first-page":"3630","volume":"29","author":"O Vinyals","year":"2016","unstructured":"Vinyals O, Blundell C, Lillicrap T et al (2016) Matching networks for one shot learning. Adv Neural Inf Process Syst 29:3630\u20133638","journal-title":"Adv Neural Inf Process Syst"},{"key":"336_CR50","first-page":"4080","volume-title":"Advances in Neural Information Processing Systems","author":"J Snell","year":"2017","unstructured":"Snell J, Swersky K, Zemel R (2017) Prototypical networks for few-shot learning. Advances in Neural Information Processing Systems, vol 30. Curran Associates, Inc., pp 4080\u20134090"},{"issue":"3","key":"336_CR51","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner A, Hendel G, Gamrath G et al (2021) MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math Program Comput 13(3):443\u2013490. https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math Program Comput"},{"issue":"3","key":"336_CR52","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s12532-023-00239-3","volume":"15","author":"M Lubin","year":"2023","unstructured":"Lubin M, Dowson O, Garcia JD et al (2023) JuMP 1.0: recent improvements to a modeling language for mathematical optimization. Math Program Comput 15(3):581\u2013589. https:\/\/doi.org\/10.1007\/s12532-023-00239-3","journal-title":"Math Program Comput"},{"issue":"2","key":"336_CR53","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/trsc.2020.1030","volume":"55","author":"C Ortiz-Astorquiza","year":"2021","unstructured":"Ortiz-Astorquiza C, Cordeau JF, Frejinger E (2021) The locomotive assignment problem with distributed power at the Canadian National Railway Company. Transp Sci 55(2):510\u2013531. https:\/\/doi.org\/10.1287\/trsc.2020.1030","journal-title":"Transp Sci"},{"key":"336_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-50137-6_7","volume-title":"Data mining and constraint programming: foundations of a cross-disciplinary approach","author":"L Kotthoff","year":"2016","unstructured":"Kotthoff L (2016) Algorithm selection for combinatorial search problems: a survey. Data mining and constraint programming: foundations of a cross-disciplinary approach. Lecture Notes in Computer Science. Springer International Publishing, pp 149\u2013190. https:\/\/doi.org\/10.1007\/978-3-319-50137-6_7"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00336-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00336-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00336-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T13:06:24Z","timestamp":1728565584000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00336-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,1]]},"references-count":54,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["336"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00336-6","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2024,7,1]]},"assertion":[{"value":"27 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No ethical approval was required for this study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"57"}}