 | Monter d'un niveau |
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
Anjos, M. F., & Liers, F. (2011). Global Approaches for Facility Layout and VLSI Floorplanning. (Rapport technique n° G-2011-34). Lien externe
Anjos, M. F., & Vieira, M. V. C. (2011). Semidefinite resolution and exactness of semidefinite relaxations for satisfiability. (Rapport technique n° G-2011-35). Lien externe
Bernardi, S., & Anjos, M. F. (2011). A Three-Stage Mathematical-Programming Method for the Multi-Floor Facility Layout Problem. (Rapport technique n° G-2011-05). Lien externe
Costanzo, G. T., Zhu, G., Anjos, M. F., & Savard, G. (2011). A System Architecture for Autonomous Demand Side Load Management in the Smart Grid. (Rapport technique n° G-2011-68). Lien externe
Engau, A., & Anjos, M. F. (2011). A Primal-Dual Interior-Point Algorithm for Linear Programming with Selective Addition of Inequalities. (Rapport technique n° G-2011-44). Lien externe
Engau, A., Anjos, M. F., & Bomze, I. (2011). An Interior-Point Algorithm with Selective Addition of Inequalities for Solving Doubly Non-Negative Relaxations of Maximum-Stable-Set and Maximum-Clique Problems. (Rapport technique n° G-2011-08). 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
Anjos, M. F. (2011). Progress in Semidefinite Optimization Techniques for Satisfiability. Dans Mahjoub, R. (édit.), Progress in Combinatorial Optimization . Lien externe
