[8] I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio. Neural combinatorial optimization with reinforcement learning, 2017.
[9] Y. Bengio, A. Lodi, and A. Prouvost. Machine learning for combinatorial optimization: A methodological tour d'horizon. European Journal of Operational Research, 290(2):405-421, Apr. 2021.
[10] K. Bestuzheva, M. Besançon, W.-K. Chen, A. Chmiela, T. Donkiewicz, J. van Doornmalen, L. Eifler, O. Gaul, G. Gamrath, A. Gleixner, L. Gottwald, C. Graczyk, K. Halbig, A. Hoen, C. Hojny, R. van der Hulst, T. Koch, M. Lübbecke, S. Maher, F. Matter, E. Mühmer, B. Müller, M. E. Pfetsch, D. Rehfeldt, S. Schlein, F. Schlösser, F. Serrano, Y. Shinano, B. Sofranac, M. Turner, S. Vigerske, F. Wegscheider, P. Wellner, D. Weninger, and J. Witzig. Enabling research through the SCIP Optimization Suite 8.0. ACM Transactions on Mathematical Software, 2023. accepted for publication.
[11] R. Bixby and E. Rothberg. Progress in computational mixed integer programming—a look back from the other side of the tipping point. Annals of Operations Research, 149(1):37-41, 2007.
[12] M. Boccia. Using exact knapsack separation for the single-source capacitated facility location problem. tech. rep., Department of Engineering, University of Sannio, 2006.
[13] A. E. Boyd. A pseudopolynomial network flow formulation for exact knapsack separation. Networks, 22(5):503-514, 1992.
[14] E. A. Boyd. Generating Fenchel cutting planes for knapsack polyhedra. SIAM Journal on Optimization, 3(4):734-750, 1993.
[15] V. Boyer, D. El Baz, and M. Elkihel. Solving knapsack problems on GPU. Computers & Operations Research, 39(1):42-47, 2012.
[16] G. Braun, A. Carderera, C. W. Combettes, H. Hassani, A. Karbasi, A. Mokthari, and S. Pokutta. Conditional gradient methods. Preprint, arXiv, 2022. https://arxiv.org/abs/2211.14103.
[17] G. Braun and S. Pokutta. Dual Prices for Frank-Wolfe Algorithms. Preprint, arXiv, 2021. https://arxiv.org/abs/2101.02087.
[18] G. Braun, S. Pokutta, and D. Zink. Lazifying conditional gradient algorithms. In Proceedings of the 34th International Conference on Machine Learning, pages 566-575, 2017.
[19] G. Braun, S. Pokutta, and D. Zink. Lazifying conditional gradient algorithms. Journal of Machine Learning Research (JMLR), 20(71):1-42, 2019.
[20] C. Buchheim, F. Liers, and M. Oswald. Local cuts revisited. Operations Research Letters, 36(4):430-433, 2008.
[21] C. Buchheim, F. Liers, and M. Oswald. Speeding up IP-based algorithms for constrained quadratic 0-1 optimization. Mathematical Programming, 124(1):513-535, 2010.
[22] A. Caprara and M. Fischetti.  $\{0, 1/2\}$ -Chvátal-Gomory cuts. Mathematical Programming, 74(3):221-235, 1996.
[23] A. Chmiela, E. B. Khalil, A. Gleixner, A. Lodi, and S. Pokutta. Learning to schedule heuristics in branch and bound. In A. Beygelzimer, Y. Dauphin, P. Liang, and J. W. Vaughan, editors, Advances in Neural Information Processing Systems, 2021.
[24] P. Chu and J. E. Beasley. A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics, 4:63-86, 1998.
[25] V. Chvátal, W. Cook, and D. Espinoza. Local cuts for mixed-integer programming. Mathematical Programming Computation, 5(2):171–200, 2013.
[26] H. P. Crowder, E. L. Johnson, and M. W. Padberg. Solving large-scale zero-one linear programming problems. Oper. Res., 31:803-834, 1983.