A branch-and-price algorithm for the single-path virtual network embedding problem
From MaRDI portal
Recommendations
- Compact and extended formulations for the virtual network embedding problem
- On the computational complexity of the virtual network embedding problem
- Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network
- Competitive and deterministic embeddings of virtual networks
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
Cited in
(7)- Compact and extended formulations for the virtual network embedding problem
- Benders decomposition for a node-capacitated virtual network function placement and routing problem
- On the computational complexity of the virtual network embedding problem
- Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
- Two extended formulations for the virtual network function placement and routing problem
- Multicommodity information flow through quantum annealer
This page was built for publication: A branch-and-price algorithm for the single-path virtual network embedding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638570)