[27] H. Dai, E. B. Khalil, Y. Zhang, B. Dilkina, and L. Song. Learning combinatorial optimization algorithms over graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems, NIPS'17, page 6351-6361, Red Hook, NY, USA, 2017. Curran Associates Inc.
[28] J.-Y. Ding, C. Zhang, L. Shen, S. Li, B. Wang, Y. Xu, and L. Song. Accelerating primal solution findings for mixed integer programs based on solution prediction. Proceedings of the AAAI Conference on Artificial Intelligence, 34(02):1452-1459, Apr. 2020.
[29] M. Frank and P. Wolfe. An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3(1-2):95-110, 1956.
[30] A. Fréville. The multidimensional 0-1 knapsack problem: An overview. European Journal of Operational Research, 155(1):1-21, 2004.
[31] M. Gasse, D. Chételat, N. Ferroni, L. Charlin, and A. Lodi. Exact Combinatorial Optimization with Graph Convolutional Neural Networks. Curran Associates Inc., Red Hook, NY, USA, 2019.
[32] R. Gomory. Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Society, 64:275-278, 1958.
[33] R. Gomory. An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Cooperation, 1960.
[34] R. Gomory. Solving linear programming problems in integers. Combinatorial Analysis, R. Bellman and J. M. Hall, eds., Symposia in Applied Mathematics X, Providence, RI, 1960, American Mathematical Society, 10:211-215, 1960.
[35] M. Grötschel, M. Jünger, and G. Reinelt. Facets of the linear ordering polytope. Mathematical Programming, 33:43-60, 1985.
[36] M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988.
[37] H. Gu. Local cuts for 0-1 multidimensional knapsack problems. In R. Sarker, H. A. Abbass, S. Dunstall, P. Kilby, R. Davis, and L. Young, editors, Data and Decision Sciences in Action, pages 81-89, Cham, 2018. Springer.
[38] Z. Gu, G. L. Nemhauser, and M. W. Savelsbergh. Sequence Independent Lifting in Mixed Integer Programming. Journal of Combinatorial Optimization, 4(1):109-129, 2000.
[39] Z. Gu, G. L. Nemhauser, and M. W. P. Savelsbergh. Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming, 85(3):439-467, 1999.
[40] J. A. J. Hall. Towards a practical parallelisation of the simplex method. Computational Management Science, 7(2):139-170, 2010.
[41] H. He, H. Daume III, and J. M. Eisner. Learning to search in branch and bound algorithms. In Z. Ghahramani, M. Welling, C. Cortes, N. Lawrence, and K. Weinberger, editors, Advances in Neural Information Processing Systems, volume 27. Curran Associates, Inc., 2014.
[42] G. Hendel. Adaptive large neighborhood search for mixed integer programming. Mathematical Programming Computation, 14(2):185-221, Nov. 2021.
[43] C. Hojny, T. Gally, O. Habeck, H. Lüthen, F. Matter, M. E. Pfetsch, and A. Schmitt. Knapsack polytopes: a survey. Annals of Operations Research, 292(1):469-517, 2020.
[44] A. Hottung and K. Tierney. Neural large neighborhood search for routing problems. Artificial Intelligence, 313:103786, 2022.
[45] Q. Huangfu and J. A. J. Hall. Parallelizing the dual revised simplex method. Mathematical Programming Computation, 10(1):119-142, 2018.