![]() | Up a level |
Adams, E., & Anjos, M. F. (2016, August). Exact separation of k-projection polytope constraints [Paper]. 16th International Conference on Modeling and Optimization: Theory and Applications (MOPTA 2016), Bethlehem, PA. External link
Adams, E. (2015). A Novel Approach to Tightening Semidefinite Relaxations for Certain Combinatorial Problems [Ph.D. thesis, École Polytechnique de Montréal]. Available
Adams, E., Anjos, M. F., Rendl, F., & Wiegele, A. (2015). A hierarchy of subgraph projection-based semidefinite relaxations for some NP-hard graph optimization problems. INFOR, 53(1), 40-48. External link