Last Updated:
November 25, 2015
by
| Version: 31
| 7,608 views
| 1 follower
members are following updates on this item.
Anjos, Miguel
Download Miguel Anjos' CV
B. Ghaddar, J.C. Vera, and M.F. Anjos. A Dynamic Inequality Generation Scheme for Polynomial Programming. To appear in Mathematical Programming (accepted February 2015).
J. Ostrowski, M.F. Anjos, and A. Vannelli. Modified Orbital Branching with Applications to Orbitopes and to Unit Commitment. To appear in Mathematical Programming (accepted August 2014).
Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
MF Anjos, XW Chang, WY Ku
Journal of Global Optimization, 1-16 (2014)
MF Anjos, XW Chang, WY Ku
Journal of Global Optimization, 1-16 (2014)
Operations Research Proceedings 2012, 275-281 (2014)
Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
MF Anjos, MVC Vieira
Discrete Applied Mathematics 161 (18), 2812-2826 (2013)
MF Anjos, MVC Vieira
Discrete Applied Mathematics 161 (18), 2812-2826 (2013)
Improved Risk Allocation-Based Algorithm for Chance-Constrained Generation Expansion Planning M. Manickavasagam
MF Anjos, WD Rosehart (2013)
MF Anjos, WD Rosehart (2013)
Chance-constrained generation expansion planning based on iterative risk allocation
M Monishaa, M Hajian, MF Anjos, WD Rosehart
Bulk Power System Dynamics and Control-IX Optimization, Security and Control ...(2013)
M Monishaa, M Hajian, MF Anjos, WD Rosehart
Bulk Power System Dynamics and Control-IX Optimization, Security and Control ...(2013)
Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
A Engau, MF Anjos, I Bomze
Mathematical Methods of Operations Research 78 (1), 35-59 (2013)
A Engau, MF Anjos, I Bomze
Mathematical Methods of Operations Research 78 (1), 35-59 (2013)
Chance-Constrained Generation Expansion Planning Based on Iterative Risk Allocation M. Monishaa, M. Hajian
MF Anjos, WD Rosehart (2013)
MF Anjos, WD Rosehart (2013)
Engineering branch-and-cut algorithms for the equicut problem
MF Anjos, F Liers, G Pardella, A Schmutzer
Discrete Geometry and Optimization, 17-32 (2013)
MF Anjos, F Liers, G Pardella, A Schmutzer
Discrete Geometry and Optimization, 17-32 (2013)
Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
MF Anjos, B Ghaddar, L Hupp, F Liers, A Wiegele
Facets of Combinatorial Optimization, 355-386 (2013)
MF Anjos, B Ghaddar, L Hupp, F Liers, A Wiegele
Facets of Combinatorial Optimization, 355-386 (2013)
Costanzo, G. T., Zhu, G., Anjos, M. F., & Savard, G. G. (2012). A System Architecture for Autonomous Demand Side Load Management in Smart Buildings. IEEE Transactions On Smart Grid, 3(4), 2157-2165.
J. Ostrowski, M.F. Anjos, and A. Vannelli. Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem. (accepted February 2012)
I. Jankovits, C. Luo, M.F. Anjos, and A. Vannelli. A Convex Optimization Framework for the Unequal-Areas Facility Layout Problem.
To appear in the European Journal of Operational Research (accepted April 2011).
Ghaddar, B., Anjos, M., & Liers, F. (2011). A branch-and-cut algorithm based on semi-definite programming for the minimum k-partition problem. Annals Of Operations Research, 188(1), 155-174.
A. Alfakih, M.F. Anjos, V. Piccialli, and H. Wolkowicz. Euclidean Distance Matrices, Semi-denite Programming, and Sensor Network Localization. Portugaliae Mathematica, 68(1), 2011, 53102 (invited survey).
B. Ghaddar, J.C. Vera, and M.F. Anjos. Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs. SIAM Journal on Optimization, 21(1), 2011, 391-414.
B. Ghaddar, M.F. Anjos, and F. Liers. A Branch-and-Cut Algorithm Based on Semidenite Programming for the Minimum k-Partition Problem. Annals of Operations Research, 188, 2011, 155-174.
B. Ghaddar, J.C. Vera, and M.F. Anjos. Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs. SIAM Journal on Optimization, 21(1), 2011, 391-414.
B. Ghaddar, M.F. Anjos, and F. Liers. A Branch-and-Cut Algorithm Based on Semidenite Programming for the Minimum k-Partition Problem. Annals of Operations Research, 188, 2011, 155-174.
A. Engau, M.F. Anjos, and A. Vannelli. On Handling Cutting Planes in Interior-Point Methods for Solving Semidenite Relaxations of Binary Quadratic Optimization Problems.To appear in Optimization Methods and Software (accepted November 2010).
Engau, A., Anjos, M. F., & Vannelli, A. (2010). An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization. Electronic Notes In Discrete Mathematics, 36(1), 743-750.
Full List of Publications: http://www.gerad.ca/files/Sites/Anjos/fichiers/MFAnjos-CV.pdf
Viewed 7,608 times
Page Options
