A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
From MaRDI portal
Publication:1728470
DOI10.1016/j.ejor.2018.12.037zbMath1430.90424arXiv1806.08871OpenAlexW2905733698MaRDI QIDQ1728470
Walid Ben-Ameur, Guanglei Wang, Adam Ouorou
Publication date: 25 February 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.08871
Related Items (2)
Exploiting sparsity for the min \(k\)-partition problem ⋮ Multi-objective temporal bin packing problem: an application in cloud computing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal mapping of cloud virtual machines
- On the computational complexity of the virtual network embedding problem
- Machine reassignment problem: the ROADEF/EURO challenge 2012
- Virtual network provisioning across multiple substrate networks
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Local branching
- Convex and concave envelopes: revisited and new perspectives
- Virtual machine placement for minimizing connection cost in data center networks
- The MILP Road to MIQCP
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On the optimal allocation of virtual resources in cloud computing networks
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- A geometric study of dual gaps, with applications
This page was built for publication: A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
