 | Monter d'un niveau |
Ghaddar, B., Anjos, M. F., & Frauke, L. (2011). A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. Annals of Operations Research, 188(1), 155-174. Lien externe
Ghaddar, B., Vera, J. C., & Anjos, M. F. (juin 2011). An iterative scheme for valid polynomial inequality generation in binary polynomial programming [Communication écrite]. 15th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2011), New York, NY, United states. Lien externe
Ghaddar, B., Vera, J. C., & Anjos, M. F. (2011). Second-order cone relaxations for binary quadratic polynomial programs. SIAM Journal on Optimization, 21(1), 391-414. Lien externe
