Two extended formulations for the virtual network function placement and routing problem

DOI10.1002/net.22144zbMath1529.90026OpenAlexW4323572413MaRDI QIDQ6179721

Eric Gourdin, Ivana Ljubić, Ahlam Mouaci, Nancy Perrot

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22144

zbMATH Keywords

column generationnetworksbranch-and-pricenetwork function virtualizationservice functions chaining

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Cites Work

• Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce
• A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
• Branching in branch-and-price: A generic scheme
• Benders decomposition for a node-capacitated virtual network function placement and routing problem
• Column Generation based Primal Heuristics
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• 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

This page was built for publication: Two extended formulations for the virtual network function placement and routing problem