The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut

DOI10.1016/j.endm.2018.02.006zbMath1392.90043OpenAlexW2793543094MaRDI QIDQ1742250

Pedro Henrique P. V. Liguori, Ibrahima Diarrassouba, Ali Ridha Mahjoub

Publication date: 11 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.02.006

zbMATH Keywords

branch-and-cutfacetpolyhedral approachasymmetric VPN tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Cites Work

• Design of trees in the hose model: the balanced case
• Provisioning virtual private networks under traffic uncertainty
• Provisioning a virtual private network
• Virtual private network design over the first Chvátal closure

This page was built for publication: The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut