A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2018.12.037 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SQPlab / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SNDlib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PLCP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2905733698 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1806.08871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the virtual network embedding problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex and concave envelopes: revisited and new perspectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MILP Road to MIQCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Virtual machine placement for minimizing connection cost in data center networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Virtual network provisioning across multiple substrate networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric study of dual gaps, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine reassignment problem: the ROADEF/EURO challenge 2012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal allocation of virtual resources in cloud computing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal mapping of cloud virtual machines / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2018.12.037 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:07, 11 December 2024

scientific article
Language Label Description Also known as
English
A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
scientific article

    Statements

    A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2019
    0 references
    integer programming
    0 references
    virtual machine assignment
    0 references
    Lagrange decomposition
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references

    Identifiers