Experiments on virtual private network design with concave capacity costs

DOI10.1007/s11590-018-1254-xzbMath1402.90100OpenAlexW2795727769WikidataQ130016701 ScholiaQ130016701MaRDI QIDQ723484

Andrea Lodi, Ahmad Moradi

Publication date: 31 July 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1254-x

zbMATH Keywords

concave costsbound tighteningspatial branch and boundvirtual private network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Uses Software

• SNDlib
• SCIP
• CPLEX

Cites Work

• Unnamed Item
• SCIP: solving constraint integer programs
• Convex extensions and envelopes of lower semi-continuous functions
• Piecewise linear approximation of functions of two variables in MILP models
• The robust network loading problem with dynamic routing
• From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
• Provisioning virtual private networks under traffic uncertainty
• On the Complexity of the Asymmetric VPN Problem
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• On the difficulty of virtual private network instances
• Provisioning a virtual private network
• Mixed-integer nonlinear optimization
• Virtual private network design over the first Chvátal closure