Optimal mapping of cloud virtual machines

DOI10.1016/j.endm.2016.03.013zbMath1351.90116OpenAlexW2407574593MaRDI QIDQ325399

Ouorou Adam, Neto José, Ben-Ameur Walid, Wang Guanglei

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.013

zbMATH Keywords

mappingvalid inequalitiesquadratic non-convex programmingreformulation-linearization-technique

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Discrete location and assignment (90B80)

Related Items (2)

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines

Cites Work

• A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
• The MILP Road to MIQCP
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

This page was built for publication: Optimal mapping of cloud virtual machines