1. Chvátal closures for mixed integer programming problems;Cook;Math. Program.,1990
2. Intersection cuts-a new type of cutting planes for integer programming;Balas;Oper. Res.,1971
3. On the rank of mixed 0, 1 polyhedra;Cornuéjols;Math. Program.,2002
4. Lower bounds on the size of general branch-and-bound trees;Dey,2021
5. Complexity of branch-and-bound and cutting planes in mixed-integer optimization-II;Basu,2021