[46] M. Jaggi. Revisiting Frank-Wolfe: projection-free sparse convex optimization. In Proceedings of the 30th International Conference on Machine Learning, pages 427-435, 2013.
[47] K. Kaparis and A. N. Letchford. Separation algorithms for 0-1 knapsack polytopes. Mathematical Programming, 124(1):69-91, 2010.
[48] E. Khalil, P. L. Bodic, L. Song, G. Nemhauser, and B. Dilkina. Learning to branch in mixed integer programming. Proceedings of the AAAI Conference on Artificial Intelligence, 30(1), Feb. 2016.
[49] E. B. Khalil, B. Dilkina, G. L. Nemhauser, S. Ahmed, and Y. Shao. Learning to run heuristics in tree search. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, Aug. 2017.
[50] T. Koch, A. Martin, and M. E. Pfetsch. Progress in academic computational integer programming. In M. Jünger and G. Reinelt, editors, *Facets of Combinatorial Optimization: Festschrift for Martin Grötschel*, pages 483–506. Springer Berlin Heidelberg, Berlin, Heidelberg, 2013.
[51] W. Kool, H. van Hoof, and M. Welling. Attention, learn to solve routing problems! In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net, 2019.
[52] S. Lacoste-Julien and M. Jaggi. On the global linear convergence of Frank-Wolfe optimization variants. In C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems 28, pages 496-504. Curran Associates, 2015.
[53] E. S. Levitin and B. T. Polyak. Constrained minimization methods. USSR Computational Mathematics and Mathematical Physics, 6(5):1-50, 1966.
[54] D. Liu, A. Lodi, and M. Tanneau. Learning chordal extensions. Journal of Global Optimization, 81(1):3-22, Jan. 2021.
[55] H. Marchand and L. A. Wolsey. Aggregation and Mixed Integer Rounding to Solve MIPs. Operations Research, 49(3):363-371, June 2001.
[56] M. Nazari, A. Oroojlooy, L. Snyder, and M. Takac. Reinforcement learning for solving the vehicle routing problem. In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 31. Curran Associates, Inc., 2018.
[57] M. E. Pfetsch, G. Rinaldi, and P. Ventura. Optimal patchings for consecutive ones matrices. Mathematical Programming Computation, 14(1):43-84, 2022.
[58] M. Posta, J. A. Ferland, and P. Michelon. An exact method with variable fixing for solving the generalized assignment problem. Computational Optimization and Applications, 52(3):629-644, 2012.
[59] J. Song, r. lanka, Y. Yue, and B. Dilkina. A general large neighborhood search framework for solving integer linear programs. In H. Larochelle, M. Ranzato, R. Hadsell, M. Balcan, and H. Lin, editors, Advances in Neural Information Processing Systems, volume 33, pages 20012-20023. Curran Associates, Inc., 2020.
[60] N. Sonnerat, P. Wang, I. Ktena, S. Bartunov, and V. Nair. Learning a large neighborhood search algorithm for mixed integer programs, 2021.
[61] Y. Tang, S. Agrawal, and Y. Faenza. Reinforcement learning for integer programming: Learning to cut. In H. D. III and A. Singh, editors, Proceedings of the 37th International Conference on Machine Learning, volume 119 of Proceedings of Machine Learning Research, pages 9367-9376. PMLR, 13-18 Jul 2020.
[62] P. Toth. Dynamic programming algorithms for the zero-one knapsack problem. Computing, 25(1):29-45, 1980.