IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v276y2019i1p28-39.html
   My bibliography  Save this article

A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines

Author

Listed:
  • Wang, Guanglei
  • Ben-Ameur, Walid
  • Ouorou, Adam

Abstract

One of the challenges of cloud computing is to optimally and efficiently assign virtual machines to physical machines. The aim of telecommunication operators is to minimize the mapping cost while respecting constraints regarding location, assignment and capacity. In this paper, we first propose an exact formulation leading to a 0–1 bilinear constrained problem. Then we introduce a variety of linear cuts by exploiting the problem structure and present a Lagrange decomposition based branch and bound algorithm to obtain optimal solutions efficiently. Numerically, we show that our valid inequalities close over 80% of the optimality gap incurred by the well-known McCormick relaxation, and demonstrate the computational advantage of the proposed B&B algorithm with extensive numerical experiments.

Suggested Citation

  • Wang, Guanglei & Ben-Ameur, Walid & Ouorou, Adam, 2019. "A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines," European Journal of Operational Research, Elsevier, vol. 276(1), pages 28-39.
    • Handle: RePEc:eee:ejores:v:276:y:2019:i:1:p:28-39
    DOI: 10.1016/j.ejor.2018.12.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718311111
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.12.037?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. H. Murat Afsar & Christian Artigues & Eric Bourreau & Safia Kedad-Sidhoum, 2016. "Machine reassignment problem: the ROADEF/EURO challenge 2012," Annals of Operations Research, Springer, vol. 242(1), pages 1-17, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jean André & Eric Bourreau & Roberto Wolfler Calvo, 2020. "Introduction to the Special Section: ROADEF/EURO Challenge 2016—Inventory Routing Problem," Transportation Science, INFORMS, vol. 54(2), pages 299-301, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:276:y:2019:i:1:p:28-39. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.