Compact and extended formulations for the virtual network embedding problem
From MaRDI portal
Recommendations
- A branch-and-price algorithm for the single-path virtual network embedding problem
- On the computational complexity of the virtual network embedding problem
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
- Resource competition in virtual network embedding
- Competitive and deterministic embeddings of virtual networks
Cites work
Cited in
(12)- Introducing the virtual network mapping problem with delay, routing and location constraints
- Benders decomposition for a node-capacitated virtual network function placement and routing problem
- Adversarial topology discovery in network virtualization environments: a threat for ISPs?
- Competitive and deterministic embeddings of virtual networks
- Data locality and replica aware virtual cluster embeddings
- Two extended formulations for the virtual network function placement and routing problem
- A branch-and-price algorithm for the single-path virtual network embedding problem
- Virtual network provisioning across multiple substrate networks
- Slice embedding solutions for distributed service architectures
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
- On the computational complexity of the virtual network embedding problem
- scientific article; zbMATH DE number 1487924 (Why is no real title available?)
This page was built for publication: Compact and extended formulations for the virtual network embedding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742226)
