Monter d'un niveau |
Adams, E. (2015). A Novel Approach to Tightening Semidefinite Relaxations for Certain Combinatorial Problems [Thèse de doctorat, École Polytechnique de Montréal]. Disponible
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. Lien externe