1. Finding a maximum clique in an arbitrary graph;Balas;SIAM J. Comput.,1986
2. No small linear program approximates vertex cover within a factor 2 - ε;Bazzi;Math. Oper. Res.,2019
3. Almost all chordal graphs split;Bender;J. Aust. Math. Soc. Ser. A. Pure Math. Stat.,1985
4. Introduction to Linear Optimization;Bertsimas,1997
5. Optimization Over Integers;Bertsimas,2005