Documents publiés en "2011"

Article de revue

Alfakih, A. Y., Anjos, M. F., Piccialli, V., & Wolkowcz, H. (2011). Euclidean distance matrices, semidefinite programming and sensor network localization. Portugaliae Mathematica, 68(1), 53-102. Lien externe

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. (2011). Second-order cone relaxations for binary quadratic polynomial programs. SIAM Journal on Optimization, 21(1), 391-414. Lien externe

Jankovits, I., Luo, C., Anjos, M. F., & Vannelli, A. (2011). A convex optimisation framework for the unequal-areas facility layout problem. European Journal of Operational Research, 214(2), 199-215. Lien externe

Communication écrite

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

Chapitre de livre

Anjos, M. F. (2011). Progress in Semidefinite Optimization Techniques for Satisfiability. Dans Mahjoub, R. (édit.), Progress in Combinatorial Optimization . Lien externe