Benders decomposition for a node-capacitated virtual network function placement and routing problem
From MaRDI portal
Publication:2668658
DOI10.1016/j.cor.2021.105227OpenAlexW3121418688MaRDI QIDQ2668658
Ahlam Mouaci, Eric Gourdin, Nancy Perrot, Ivana Ljubić
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105227
combinatorial optimizationBenders decompositionnetwork function virtualizationservice function chainingsoftware defined networking
Related Items
Uses Software
Cites Work
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Energy-efficient service function chain provisioning
- A note on the selection of Benders' cuts
- Implementing Automatic Benders Decomposition in a Modern MIP Solver
- Finding the K Shortest Loopless Paths in a Network
- On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations