Experiments on virtual private network design with concave capacity costs
From MaRDI portal
(Redirected from Publication:723484)
Recommendations
Cites work
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex extensions and envelopes of lower semi-continuous functions
- From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk
- Mixed-integer nonlinear optimization
- Multicommodity network flow models and algorithms in telecommunications
- On the Complexity of the Asymmetric VPN Problem
- On the difficulty of virtual private network instances
- Piecewise linear approximation of functions of two variables in MILP models
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Provisioning virtual private networks under traffic uncertainty
- SCIP: solving constraint integer programs
- The robust network loading problem with dynamic routing
- Virtual private network design over the first Chvátal closure
Cited in
(6)- Virtual private network design over the first Chvátal closure
- The VPN Problem with Concave Costs
- scientific article; zbMATH DE number 1927255 (Why is no real title available?)
- An improved approximation algorithm for virtual private network design
- On the difficulty of virtual private network instances
- scientific article; zbMATH DE number 1487924 (Why is no real title available?)
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)