On the public citation graph
Provisioning virtual private networks under traffic uncertainty
0 signed · 79 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11496915_30openalex-snapshot
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
inferredcites →https://doi.org/10.1007/3-540-45753-4_22openalex-snapshot
Primal-Dual Algorithms for Connected Facility Location Problems
inferredcites →https://doi.org/10.1007/3-540-48318-7_4openalex-snapshot
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison
inferredcites →https://doi.org/10.1007/s10107-003-0396-4openalex-snapshot
Robust discrete optimization and network flows
inferredcites →https://doi.org/10.1007/s11081-005-1741-7openalex-snapshot
Routing of Uncertain Traffic Demands
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/infcom.2004.1354650openalex-snapshot
Optimal bandwidth reservation in hose-model VPNs with multi-path routing
inferredcites →https://doi.org/10.1145/316194.316209openalex-snapshot
A flexible model for resource management in virtual private networks
inferredcites →https://doi.org/10.1145/380752.380830openalex-snapshot
Provisioning a virtual private network
inferredcites →https://doi.org/10.1145/780542.780597openalex-snapshot
Simpler and better approximation algorithms for network design
inferredcites →https://doi.org/10.1287/opre.21.5.1154openalex-snapshot
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
inferredcites →https://doi.org/10.1287/opre.46.3.316openalex-snapshot
Branch-and-Price: Column Generation for Solving Huge Integer Programs
inferredcites →https://doi.org/10.1287/opre.48.2.318.12378openalex-snapshot
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.3891openalex-snapshot
Approach to problem of minimizing network power consumption based on robust optimization
inferred← citeshttps://doi.org/10.1002/net.21461openalex-snapshot
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
inferred← citeshttps://doi.org/10.1002/net.21482openalex-snapshot
Affine recourse for the robust network design problem: Between static and dynamic routing
inferred← citeshttps://doi.org/10.1002/net.21497openalex-snapshot
Robust network design: Formulations, valid inequalities, and computations
inferred← citeshttps://doi.org/10.1002/net.21548openalex-snapshot
On the difficulty of virtual private network instances
inferred← citeshttps://doi.org/10.1002/net.21621openalex-snapshot
The cut property under demand uncertainty
inferred← citeshttps://doi.org/10.1002/net.22184openalex-snapshot
Robust transshipment problem under consistent flow constraints
inferred← citeshttps://doi.org/10.1007/978-1-4419-0534-5_7openalex-snapshot
A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-04277-0_17openalex-snapshot
Network Planning for Stochastic Traffic Demands
inferred← citeshttps://doi.org/10.1007/978-3-319-28697-6_48openalex-snapshot
Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-642-20798-3_8openalex-snapshot
A Flexible Auction Model for Virtual Private Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_15openalex-snapshot
Cutset Inequalities for Robust Network Design
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_19openalex-snapshot
Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_2openalex-snapshot
An Exact Algorithm for Robust Network Design
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_24openalex-snapshot
Models and Algorithms for Robust Network Design with Several Traffic Scenarios
inferred← citeshttps://doi.org/10.1007/s10107-016-0991-9openalex-snapshot
Single-commodity robust network design with finite and Hose demand sets
inferred← citeshttps://doi.org/10.1007/s10479-021-04426-0openalex-snapshot
Robust minimum cost flow problem under consistent flow constraints
inferred← citeshttps://doi.org/10.1007/s10589-012-9500-0openalex-snapshot
The robust network loading problem with dynamic routing
inferred← citeshttps://doi.org/10.1007/s10589-017-9956-zopenalex-snapshot
A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
inferred← citeshttps://doi.org/10.1007/s10589-019-00085-xopenalex-snapshot
Robust optimal discrete arc sizing for tree-shaped potential networks
inferred← citeshttps://doi.org/10.1007/s11081-009-9098-yopenalex-snapshot
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
inferred← citeshttps://doi.org/10.1007/s11235-011-9602-5openalex-snapshot
Volume-oriented routing and its modifications
inferred← citeshttps://doi.org/10.1007/s11590-013-0679-5openalex-snapshot
A comparison of routing sets for robust network design
inferred← citeshttps://doi.org/10.1007/s11590-018-1254-xopenalex-snapshot
Experiments on virtual private network design with concave capacity costs
inferred← citeshttps://doi.org/10.1007/s11590-019-01427-8openalex-snapshot
Generalized Hose uncertainty in single-commodity robust network design
inferred← citeshttps://doi.org/10.1016/j.adhoc.2025.103933openalex-snapshot
A simulation-informed robust optimization framework for the design of energy efficient underwater sensor networks
inferred← citeshttps://doi.org/10.1016/j.cor.2015.05.008openalex-snapshot
Robust energy-aware routing with redundancy elimination
inferred← citeshttps://doi.org/10.1016/j.cor.2017.06.011openalex-snapshot
A capacitated hub location problem under hose demand uncertainty
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105493openalex-snapshot
A robust optimization model for distribution network design under a mixed integer set of scenarios
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.09.004openalex-snapshot
Robust combinatorial optimization with knapsack uncertainty
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.04.023openalex-snapshot
Single-commodity robust network design problem: Complexity, instances and heuristic solutions
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.06.021openalex-snapshot
Designing networks with resiliency to edge failures using two-stage robust optimization
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.076openalex-snapshot
Multipolar routing: where dynamic and static routing meet
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.106openalex-snapshot
The cut condition for robust network design
inferred← citeshttps://doi.org/10.1016/j.endm.2018.02.006openalex-snapshot
The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut
inferred← citeshttps://doi.org/10.1016/j.orl.2010.09.005openalex-snapshot
Easy distributions for combinatorial optimization problems with probabilistic constraints
inferred← citeshttps://doi.org/10.1051/ro/2014056openalex-snapshot
Virtual private network design over the first Chvátal closure
inferred← citeshttps://doi.org/10.1109/atnac.2007.4665255openalex-snapshot
A simple web-services interface of a VPN services architecture
inferred← citeshttps://doi.org/10.1109/drcn.2007.4762277openalex-snapshot
Between fully dynamic routing and robust stable routing
inferred← citeshttps://doi.org/10.1109/drcn.2011.6076885openalex-snapshot
An integrated model for survivable network design under demand uncertainty
inferred← citeshttps://doi.org/10.1109/drcn.2015.7148978openalex-snapshot
Virtual network embedding under uncertainty: Exact and heuristic approaches
inferred← citeshttps://doi.org/10.1109/greencom-ithings-cpscom.2013.51openalex-snapshot
Robust Redundancy Elimination for Energy-Aware Routing
inferred← citeshttps://doi.org/10.1109/icc.2011.5962479openalex-snapshot
On the Robustness of Optimal Network Designs
inferred← citeshttps://doi.org/10.1109/icnc.2011.6022538openalex-snapshot
Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models
inferred← citeshttps://doi.org/10.1109/iswcs.2019.8877372openalex-snapshot
An Efficient Model for Mobile Network Slice Embedding under Resource Uncertainty
inferred← citeshttps://doi.org/10.1109/jsac.2016.2545378openalex-snapshot
A Green and Robust Optimization Strategy for Energy Saving Against Traffic Uncertainty
inferred← citeshttps://doi.org/10.1109/ncca.2011.13openalex-snapshot
Dynamic IGP Weight Optimization in IP Networks
inferred← citeshttps://doi.org/10.1109/netwks.2012.6381675openalex-snapshot
From constant traffic matrices to hose workload model for VPN tree design
inferred← citeshttps://doi.org/10.1109/netwks.2014.6959234openalex-snapshot
Network planning guaranteeing end-to-end overload probability for stochastic traffic demands
inferred← citeshttps://doi.org/10.1109/ngi.2010.5534462openalex-snapshot
Towards robust network design using integer linear programming techniques
inferred← citeshttps://doi.org/10.1109/ondm.2012.6210204openalex-snapshot
Robust upgrade in optical networks under traffic uncertainty
inferred← citeshttps://doi.org/10.1109/tcomm.2013.082813.120639openalex-snapshot
Discrete-Bandwidth Nonblocking Networks
inferred← citeshttps://doi.org/10.1109/tnet.2008.2006219openalex-snapshot
Optimal Link Weights for IP-Based Networks Supporting Hose-Model VPNs
inferred← citeshttps://doi.org/10.1109/tnet.2014.2353576openalex-snapshot
Shortest Path Versus Multihub Routing in Networks With Uncertain Demand
inferred← citeshttps://doi.org/10.1109/tnet.2016.2606480openalex-snapshot
Congestion-Aware Embedding of Heterogeneous Bandwidth Virtual Data Centers With Hose Model Abstraction
inferred← citeshttps://doi.org/10.1109/tvt.2014.2357034openalex-snapshot
Energy Conservation Routing in Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2010.00764.xopenalex-snapshot
Robust routing and optimal partitioning of a traffic demand polytope
inferred← citeshttps://doi.org/10.1287/ijoc.1100.0380openalex-snapshot
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
inferred← citeshttps://doi.org/10.1287/ijoo.2023.0091openalex-snapshot
Data-Driven Distributionally Robust Optimization over Time
inferred← citeshttps://doi.org/10.1287/opre.1120.1049openalex-snapshot
Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
inferred← citeshttps://doi.org/10.1287/opre.2017.1679openalex-snapshot
A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.