Experiments on virtual private network design with concave capacity costs
From MaRDI portal
Publication:723484
DOI10.1007/S11590-018-1254-XzbMATH Open1402.90100OpenAlexW2795727769WikidataQ130016701 ScholiaQ130016701MaRDI QIDQ723484FDOQ723484
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
Recommendations
Cites Work
- SCIP: solving constraint integer programs
- Mixed-integer nonlinear optimization
- Convex extensions and envelopes of lower semi-continuous functions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The robust network loading problem with dynamic routing
- Provisioning virtual private networks under traffic uncertainty
- Multicommodity network flow models and algorithms in telecommunications
- Piecewise linear approximation of functions of two variables in MILP models
- Provisioning a virtual private network
- From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk
- On the Complexity of the Asymmetric VPN Problem
- On the difficulty of virtual private network instances
- Virtual private network design over the first Chvátal closure
Cited In (4)
Uses Software
This page was built for publication: Experiments on virtual private network design with concave capacity costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723484)