Benders decomposition for a node-capacitated virtual network function placement and routing problem
From MaRDI portal
Publication:2668658
Recommendations
- Service chain placement in SDNs
- Compact and extended formulations for the virtual network embedding problem
- A branch-and-price algorithm for the single-path virtual network embedding problem
- On the computational complexity of the virtual network embedding problem
- Capacity and flow assignment of data networks by generalized Benders decomposition
Cites work
- A note on the selection of Benders' cuts
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Energy-efficient service function chain provisioning
- Finding the K Shortest Loopless Paths in a Network
- Implementing automatic benders decomposition in a modern MIP solver
- On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations
Cited in
(3)
This page was built for publication: Benders decomposition for a node-capacitated virtual network function placement and routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668658)