( en | de | ru )

 

Disambiguation of "Anjos, Miguel F."

Author of the publication

copydeleteadd this publication to your clipboard
Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems.

, , , , and . CoRR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Miguel Beato

Miguel Cardozo

Miguel Cruset

Miguel Astner

Miguel Coelho

 

Other publications of authors with the same name

An Exact Approach for the Combined Cell Layout Problem., and . OR, page 275-281. Springer, (2012)Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems., , and . J. Glob. Optim., 59 (2-3): 227-242 (2014)Improved exact approaches for row layout problems with departments of equal length., , and . Eur. J. Oper. Res., 270 (2): 514-529 (2018)Improving the linear relaxation of maximum k-cut with semidefinite-based constraints., , and . EURO J. Comput. Optim., 7 (2): 123-151 (2019)Complexity of near-optimal robust versions of multilevel optimization problems., , and . Optim. Lett., 15 (8): 2597-2610 (2021)Mathematical optimization approach for facility layout on several rows., and . Optim. Lett., 15 (1): 9-23 (2021)An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs.. Ann. Math. Artif. Intell., 48 (1-2): 1-14 (2006)Provably near-optimal solutions for very large single-row facility layout problems., and . Optim. Methods Softw., 24 (4-5): 805-817 (2009)Preface to the special issue of INFOR on "continuous optimization and applications in machine learning and data analytics"., , , and . INFOR Inf. Syst. Oper. Res., 58 (2): 167 (2020)Computational study of a branching algorithm for the maximum k-cut problem., , and . Discret. Optim., 44 (Part): 100656 (2022)