{"type":"ScholarlyArticle","title":"Machine Learning for Cutting Planes in Integer Programming: A Survey","authors":[{"name":"Arnaud Deza","slug":"arnaud-deza","given":"Arnaud","family":"Deza","affiliation":"Department of Mechanical & Industrial Engineering , University of Toronto"},{"name":"Elias B. Khalil","slug":"elias-b-khalil","given":"Elias B.","family":"Khalil","affiliation":"Department of Mechanical & Industrial Engineering , University of Toronto; SCALE AI Research in Data-Driven Algorithms for Modern Supply Chains"}],"abstract":"We survey recent work on machine learning (ML) techniques for selecting cutting planes (or cuts) in mixed-integer linear programming (MILP). Despite the availability of various classes of cuts, the task of choosing a set of cuts to add to the linear programming (LP) relaxation at a given node of the branch-and-bound (B&B) tree has defied both formal and heuristic solutions to date. ML offers a promising approach for improving the cut selection process by using data to identify promising cuts that accelerate the solution of MILP instances. This paper presents an overview of the topic, highlighting recent advances in the literature, common approaches to data collection, evaluation, and ML model architectures. We analyze the empirical results in the literature in an attempt to quantify the progress that has been made and conclude by suggesting avenues for future research.","doi":"10.24963/ijcai.2023/739","url":"https://ijcai.org/proceedings/2023/739","pdf":"https://ijcai.org/proceedings/2023/0739.pdf","markdown":"https://ijcai.org/proceedings/2023/739.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/739","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Survey Track","track":"Survey Track","number":739,"pages":{"first":6592,"last":6600},"keywords":["Survey: Machine Learning","Survey: Constraint Satisfaction and Optimization"],"videos":[],"references":[{"position":1,"raw":"[Achterberg, 2007] Tobias Achterberg. Constraint integer programming. phd thesis. Technical report, TU Berlin, 2007.","title":"Constraint integer programming","authors":"Achterberg","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ahmed, 2010] Shabbir Ahmed. Two-stage stochastic inte- ger programming: A brief introduction. Wiley encyclope- dia of operations research and management science, pages 1-10, 2010.","title":"Two-stage stochastic integer programming: A brief introduction","authors":"Shabbir Ahmed","year":"2010","venue":"Wiley encyclopedia of operations research and management science","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Amaldi et al., 2014] Edoardo Amaldi, Stefano Coniglio, and Stefano Gualandi. Coordinated cutting plane gener- ation via multi-objective separation. Mathematical Pro- gramming, 143:87-110, 2014.","title":"Coordinated cutting plane generation via multi-objective separation","authors":"Edoardo Amaldi, Stefano Coniglio, Stefano Gualandi","year":"2014","venue":"Mathematical Programming","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Anderson et al., 1999] Edward Anderson, Zhaojun Bai, Christian Bischof, L Susan Blackford, James Demmel, Jack Dongarra, Jeremy Du Croz, Anne Greenbaum, Sven Hammarling, Alan McKenney, et al. LAPACK users' guide. SIAM, 1999.","title":"LAPACK users' guide","authors":"Edward Anderson, Zhaojun Bai, Christian Bischof, Susan Blackford, James Demmel, Jack Dongarra, Jeremy Du Croz, Anne Greenbaum, Sven Hammarling, Alan Mckenney","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[ApS, 2019] MOSEK ApS. Mosek fusion api for python. https://docs.mosek.com/8.1/pythonfusion.pdf, 2019. Ac- cessed: 2023-03-13.","title":"MOSEK ApS. Mosek fusion api for python","authors":"Aps","year":"2019","venue":null,"doi":null,"url":"-cessed:2023-03-13","internal_url":null},{"position":6,"raw":"[Balcan et al., 2021a] Maria-Florina Balcan, Dan DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, and Ellen Vitercik. How much data is sufficient to learn high- performing algorithms? generalization guarantees for data-driven algorithm design. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Comput- ing, pages 919-932, 2021.","title":"How much data is sufficient to learn highperforming algorithms? generalization guarantees for data-driven algorithm design","authors":"Balcan","year":"2021","venue":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Balcan et al., 2021b] Maria-Florina F Balcan, Siddharth Prasad, Tuomas Sandholm, and Ellen Vitercik. Sample complexity of tree search configuration: Cutting planes and beyond. Advances in Neural Information Processing Systems, 34:4015-4027, 2021.","title":"Sample complexity of tree search configuration: Cutting planes and beyond","authors":"Balcan","year":"2021","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Balcan et al., 2022] Maria Florina Balcan, Siddharth Prasad, Tuomas Sandholm, and Ellen Vitercik. Structural analysis of branch-and-cut and the learnability of gomory mixed integer cuts. Advances in Neural Information Processing Systems, 2022.","title":"Structural analysis of branch-and-cut and the learnability of gomory mixed integer cuts","authors":"Maria Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik","year":"2022","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Baltean-Lugojan et al., 2019] Radu Baltean-Lugojan, Pierre Bonami, Ruth Misener, and Andrea Tramon- tani. Scoring positive semidefinite cutting planes for quadratic optimization via trained neural networks. preprint: http://www. optimization-online. org/DB HTML/2018/11/6943. html, 2019. Accessed: 2023-03-13.","title":"Scoring positive semidefinite cutting planes for quadratic optimization via trained neural networks","authors":"Radu Baltean-Lugojan, Pierre Bonami, Ruth Misener, Andrea Tramontani","year":"2019","venue":null,"doi":null,"url":"http://www.optimization-online.org/DBHTML/2018/11/6943.html","internal_url":null},{"position":10,"raw":"[Bello et al., 2016] Irwan Bello, Hieu Pham, Quoc V Le, Mohammad Norouzi, and Samy Bengio. Neural combi- natorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940, 2016.","title":"Neural combinatorial optimization with reinforcement learning","authors":"Irwan Bello, Hieu Pham, V Quoc, Mohammad Le, Samy Norouzi, Bengio","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bengio et al., 2021] Yoshua Bengio, Andrea Lodi, and An- toine Prouvost. Machine learning for combinatorial op- timization: a methodological tour d'horizon. European Journal of Operational Research, 290(2):405-421, 2021.","title":"Machine learning for combinatorial optimization: a methodological tour d'horizon","authors":"Yoshua Bengio, Andrea Lodi","year":"2021","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Berthold et al., 2022] Timo Berthold, Matteo Francobaldi, and Gregor Hendel. Learning to use local cuts. arXiv preprint arXiv:2206.11618, 2022.","title":"Learning to use local cuts","authors":"Timo Berthold, Matteo Francobaldi, Gregor Hendel","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Bestuzheva et al., 2021] Ksenia Bestuzheva, Mathieu Besanc ¸on, Wei-Kun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros Gleixner, et al. The scip optimization suite 8.0. arXiv preprint arXiv:2112.08872, 2021.","title":"The scip optimization suite 8.0","authors":"Ksenia Bestuzheva, Wei-Kun Mathieu Besanc ¸on, Antonia Chen, Tim Chmiela, Donkiewicz, Leon Jasper Van Doornmalen, Oliver Eifler, Gerald Gaul, Ambros Gamrath, Gleixner","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Cappart et al., 2021] Quentin Cappart, Didier Chételat, Elias Khalil, Andrea Lodi, Christopher Morris, and Petar Veličković. Combinatorial optimization and rea- soning with graph neural networks. arXiv preprint arXiv:2102.09544, 2021.","title":"Combinatorial optimization and reasoning with graph neural networks","authors":"Quentin Cappart, Didier Chételat, Elias Khalil, Andrea Lodi, Christopher Morris, Petar Veličković","year":"2021","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/2021/595"},{"position":15,"raw":"[Chmiela et al., 2021] Antonia Chmiela, Elias Khalil, Am- bros Gleixner, Andrea Lodi, and Sebastian Pokutta. Learn- ing to schedule heuristics in branch and bound. Advances in Neural Information Processing Systems, 34:24235- 24246, 2021.","title":"Learning to schedule heuristics in branch and bound","authors":"Antonia Chmiela, Elias Khalil, Ambros Gleixner, Andrea Lodi, Sebastian Pokutta","year":"2021","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Coniglio and Tieves, 2015] Stefano Coniglio and Martin Tieves. On the generation of cutting planes which max- imize the bound improvement. In Experimental Algo- rithms: 14th International Symposium, SEA 2015, Paris, France, June 29-July 1, 2015, Proceedings, pages 97-109. Springer, 2015. Contardo et al., 2022]","title":"On the generation of cutting planes which maximize the bound improvement","authors":"Stefano Coniglio, Martin Tieves","year":"2015","venue":"Experimental Algorithms: 14th International Symposium, SEA 2015","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"Claudio Contardo, Andrea Lodi, and Andrea Tramontani. Cutting planes from the branch-and- bound tree: Challenges and opportunities. INFORMS Journal on Computing, 2022.","title":"Cutting planes from the branch-andbound tree: Challenges and opportunities","authors":"Claudio Contardo, Andrea Lodi, Andrea Tramontani","year":"2022","venue":"INFORMS Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Dey and Molinaro, 2018] Santanu S Dey and Marco Moli- naro. Theoretical challenges towards cutting-plane selec- tion. Mathematical Programming, 170:237-266, 2018.","title":"Theoretical challenges towards cutting-plane selection","authors":"S Santanu, Marco Dey, Molinaro","year":"2018","venue":"Mathematical Programming","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gamrath et al., 2020] Gerald Gamrath, Daniel Anderson, Ksenia Bestuzheva, Wei-Kun Chen, Leon Eifler, Maxime Gasse, Patrick Gemander, Ambros Gleixner, Leona Gottwald, Katrin Halbig, et al. The scip optimization suite 7.0. Technical Report 20-10, ZIB, Takustr. 7, 14195 Berlin, 2020.","title":"The scip optimization suite 7.0","authors":"Gerald Gamrath, Daniel Anderson, Ksenia Bestuzheva, Wei-Kun Chen, Leon Eifler, Maxime Gasse, Patrick Gemander, Ambros Gleixner, Leona Gottwald, Katrin Halbig","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Gasse et al., 2019] Maxime Gasse, Didier Chételat, Nicola Ferroni, Laurent Charlin, and Andrea Lodi. Exact combi- natorial optimization with graph convolutional neural net- works. Advances in neural information processing sys- tems, 32, 2019.","title":"Exact combinatorial optimization with graph convolutional neural networks","authors":"Maxime Gasse, Didier Chételat, Nicola Ferroni, Laurent Charlin, Andrea Lodi","year":"2019","venue":"Advances in neural information processing systems","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Gleixner et al., 2018] Ambros Gleixner, Michael Bastubbe, Leon Eifler, Tristan Gally, Gerald Gamrath, Robert Lion Gottwald, Gregor Hendel, Christopher Hojny, Thorsten Koch, Marco E Lübbecke, et al. The scip optimization suite 6.0. technical report. Optimization Online, 2018.","title":"The scip optimization suite 6.0","authors":"Ambros Gleixner, Michael Bastubbe, Leon Eifler, Tristan Gally, Gerald Gamrath, Lion Robert, Gregor Gottwald, Christopher Hendel, Thorsten Hojny, Marco E Koch, Lübbecke","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Gleixner et al., 2021] Ambros Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff Linderoth, et al. Miplib 2017: data- driven compilation of the 6th mixed-integer program- ming library. Mathematical Programming Computation, 13(3):443-490, 2021.","title":"Miplib 2017: datadriven compilation of the 6th mixed-integer programming library","authors":"Ambros Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff Linderoth","year":"2021","venue":"Mathematical Programming Computation","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Huang et al., 2022] Zeren Huang, Kerong Wang, Furui Liu, Hui-Ling Zhen, Weinan Zhang, Mingxuan Yuan, Jianye Hao, Yong Yu, and Jun Wang. Learning to select cuts for efficient mixed-integer programming. Pattern Recog- nition, 123:108353, 2022.","title":"Learning to select cuts for efficient mixed-integer programming","authors":"Zeren Huang, Kerong Wang, Furui Liu, Hui-Ling Zhen, Weinan Zhang, Mingxuan Yuan, Jianye Hao, Yong Yu, Jun Wang","year":"2022","venue":"Pattern Recognition","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Ilse et al., 2018] Maximilian Ilse, Jakub Tomczak, and Max Welling. Attention-based deep multiple instance learning. In International conference on machine learning, pages 2127-2136. PMLR, 2018.","title":"Attention-based deep multiple instance learning","authors":"Maximilian Ilse, Jakub Tomczak, Max Welling","year":"2018","venue":"International conference on machine learning","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Jia and Shen, 2021] Huiwen Jia and Siqian Shen. Benders cut classification via support vector machines for solving two-stage stochastic programs. INFORMS Journal on Op- timization, 3(3):278-297, 2021.","title":"Benders cut classification via support vector machines for solving two-stage stochastic programs","authors":"Shen Jia, Huiwen Jia, Siqian Shen","year":"2021","venue":"INFORMS Journal on Optimization","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Khalil et al., 2016] Elias Khalil, Pierre Le Bodic, Le Song, George Nemhauser, and Bistra Dilkina. Learning to branch in mixed integer programming. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 30, 2016.","title":"Learning to branch in mixed integer programming","authors":"Elias Khalil, Pierre Le Bodic, Le Song, George Nemhauser, Bistra Dilkina","year":"2016","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Khalil et al., 2022] Elias B Khalil, Christopher Morris, and Andrea Lodi. Mip-gnn: A data-driven framework for guid- ing combinatorial solvers. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 10219-10227, 2022.","title":"Mip-gnn: A data-driven framework for guiding combinatorial solvers","authors":"Christopher Elias B Khalil, Andrea Morris, Lodi","year":"2022","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Koch et al., 2011] Thorsten Koch, Tobias Achterberg, Er- ling Andersen, Oliver Bastert, Timo Berthold, Robert E Bixby, Emilie Danna, Gerald Gamrath, Ambros M Gleixner, Stefan Heinz, et al. Miplib 2010: mixed integer programming library version 5. Mathematical Program- ming Computation, 3:103-163, 2011.","title":"Miplib 2010: mixed integer programming library version 5","authors":"Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E Bixby, Emilie Danna, Gerald Gamrath, Ambros M Gleixner, Stefan Heinz","year":"2011","venue":"Mathematical Programming Computation","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Kool et al., 2018] Wouter Kool, Herke Van Hoof, and Max Welling. Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475, 2018.","title":"Attention, learn to solve routing problems!","authors":"Wouter Kool, Herke Van Hoof, Max Welling","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Kotary et al., 2021] James Kotary, Ferdinando Fioretto, Pascal Van Hentenryck, and Bryan Wilder. End-to- end constrained optimization learning: A survey. arXiv preprint arXiv:2103.16378, 2021.","title":"End-toend constrained optimization learning: A survey","authors":"James Kotary, Ferdinando Fioretto, Pascal Van Hentenryck, Bryan Wilder","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":31,"raw":"Ailsa H Land and Alison G Doig. An automatic method for solving discrete programming prob- lems. Springer, 2010.","title":"An automatic method for solving discrete programming problems","authors":"H Ailsa, Alison G Land, Doig","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Lindauer et al., 2022] Marius Lindauer, Katharina Eggensperger, Matthias Feurer, André Biedenkapp, Difan Deng, Carolin Benjamins, Tim Ruhkopf, René Sass, and Frank Hutter. Smac3: A versatile bayesian optimization package for hyperparameter optimization. J. Mach. Learn. Res., 23(54):1-9, 2022.","title":"Smac3: A versatile bayesian optimization package for hyperparameter optimization","authors":"Marius Lindauer, Katharina Eggensperger, Matthias Feurer, André Biedenkapp, Difan Deng, Carolin Benjamins, Tim Ruhkopf, René Sass, Frank Hutter","year":"2022","venue":"J. Mach. Learn. Res","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Lodi and Tramontani, 2013] Andrea Lodi and Andrea Tra- montani. Performance variability in mixed-integer pro- gramming. In Theory driven by influential applications, pages 1-12. INFORMS, 2013.","title":"Performance variability in mixed-integer programming","authors":"Andrea Lodi, Andrea Tramontani","year":"2013","venue":"Theory driven by influential applications","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Malitsky and Malitsky, 2014] Yuri Malitsky and Yuri Mal- itsky. Instance-specific algorithm configuration. Springer, 2014.","title":"Instance-specific algorithm configuration","authors":"Yuri Malitsky, Yuri Malitsky","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Mazyavkina et al., 2021] Nina Mazyavkina, Sergey Sviri- dov, Sergei Ivanov, and Evgeny Burnaev. Reinforcement learning for combinatorial optimization: A survey. Com- puters & Operations Research, 134:105400, 2021.","title":"Reinforcement learning for combinatorial optimization: A survey","authors":"Nina Mazyavkina, Sergey Sviridov, Sergei Ivanov, Evgeny Burnaev","year":"2021","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Nair et al., 2020] Vinod Nair, Sergey Bartunov, Felix Gi- meno, Ingrid Von Glehn, Pawel Lichocki, Ivan Lobov, Brendan O'Donoghue, Nicolas Sonnerat, Christian Tjan- draatmadja, Pengming Wang, et al. Solving mixed in- teger programs using neural networks. arXiv preprint arXiv:2012.13349, 2020.","title":"Solving mixed integer programs using neural networks","authors":"Vinod Nair, Sergey Bartunov, Felix Gimeno, Ingrid Von Glehn, Pawel Lichocki, Ivan Lobov, O' Brendan, Nicolas Donoghue, Christian Sonnerat, Pengming Tjandraatmadja, Wang","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Nowak et al., 2018] Alex Nowak, Soledad Villar, Afonso S Bandeira, and Joan Bruna. Revised note on learning quadratic assignment with graph neural networks. In 2018 IEEE Data Science Workshop (DSW), pages 1-5. IEEE, 2018.","title":"Revised note on learning quadratic assignment with graph neural networks","authors":"Alex Nowak, Soledad Villar, Afonso S Bandeira, Joan Bruna","year":"2018","venue":"IEEE Data Science Workshop (DSW)","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Paulus et al., 2022] Max B Paulus, Giulia Zarpellon, An- dreas Krause, Laurent Charlin, and Chris Maddison. Learning to cut by looking ahead: Cutting plane selection via imitation learning. In International conference on ma- chine learning, pages 17584-17600. PMLR, 2022.","title":"Learning to cut by looking ahead: Cutting plane selection via imitation learning","authors":"Paulus","year":"2022","venue":"International conference on machine learning","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Polik et al., 2007] Imre Polik, Tamas Terlaky, and Yuriy Zinchenko. Sedumi: a package for conic optimization. In IMA workshop on Optimization and Control, Univ. Min- nesota, Minneapolis. Citeseer, 2007.","title":"Sedumi: a package for conic optimization","authors":"Polik","year":"2007","venue":"IMA workshop on Optimization and Control","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Tang et al., 2020] Yunhao Tang, Shipra Agrawal, and Yuri Faenza. Reinforcement learning for integer programming: Learning to cut. In International conference on machine learning, pages 9367-9376. PMLR, 2020.","title":"Reinforcement learning for integer programming: Learning to cut","authors":"Yunhao Tang, Shipra Agrawal, Yuri Faenza","year":"2020","venue":"International conference on machine learning","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Turner et al., 2022a] Mark Turner, Timo Berthold, Mathieu Besanc ¸on, and Thorsten Koch. Cutting plane selection with analytic centers and multiregression. arXiv preprint arXiv:2212.07231, 2022.","title":"Cutting plane selection with analytic centers and multiregression","authors":"Turner","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Turner et al., 2022b] Mark Turner, Thorsten Koch, Felipe Serrano, and Michael Winkler. Adaptive cut selection in mixed-integer linear programming. arXiv preprint arXiv:2202.10962, 2022.","title":"Adaptive cut selection in mixed-integer linear programming","authors":"Turner","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Vinyals et al., 2015] Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. Pointer networks. Advances in neural in- formation processing systems, 28, 2015.","title":"Pointer networks","authors":"Oriol Vinyals, Meire Fortunato, Navdeep Jaitly","year":"2015","venue":"Advances in neural information processing systems","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Wang et al., 2023] Zhihai Wang, Xijun Li, Jie Wang, Yufei Kuang, Mingxuan Yuan, Jia Zeng, Yongdong Zhang, and Feng Wu. Learning cut selection for mixed-integer lin- ear programming via hierarchical sequence model. arXiv preprint arXiv:2302.00244, 2023.","title":"Learning cut selection for mixed-integer linear programming via hierarchical sequence model","authors":"Wang","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Wesselmann and Stuhl, 2012] Franz Wesselmann and U Stuhl. Implementing cutting plane management and selection techniques. In Technical Report. University of Paderborn, 2012.","title":"Implementing cutting plane management and selection techniques","authors":"Stuhl Wesselmann, Franz Wesselmann, U Stuhl","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Xu et al., 2011] Lin Xu, Frank Hutter, Holger H Hoos, and Kevin Leyton-Brown. Hydra-mip: Automated algorithm configuration and selection for mixed integer program- ming. In RCRA workshop on experimental evaluation of algorithms for solving problems with combinatorial explo- sion at the international joint conference on artificial in- telligence (IJCAI), pages 16-30, 2011.","title":"Hydra-mip: Automated algorithm configuration and selection for mixed integer programming","authors":"Lin Xu, Frank Hutter, Kevin Holger H Hoos, Leyton-Brown","year":"2011","venue":"RCRA workshop on experimental evaluation of algorithms for solving problems with combinatorial explosion at the international joint conference on artificial intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Zarpellon et al., 2021] Giulia Zarpellon, Jason Jo, Andrea Lodi, and Yoshua Bengio. Parameterizing branch-and- bound search trees to learn branching policies. In Pro- ceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 3931-3939, 2021.","title":"Parameterizing branch-andbound search trees to learn branching policies","authors":"Giulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua Bengio","year":"2021","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}