Pages that link to "Item:Q833385"
From MaRDI portal
The following pages link to Routing of uncertain traffic demands (Q833385):
Displaying 48 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty (Q339584) (← links)
- Robust delay-constrained routing in telecommunications (Q363561) (← links)
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- A comparison of routing sets for robust network design (Q479214) (← links)
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
- On 2-stage robust LP with RHS uncertainty: complexity results and applications (Q628752) (← links)
- Static and dynamic routing under disjoint dominant extreme demands (Q631210) (← links)
- On total traffic domination in non-complete graphs (Q631212) (← links)
- Design of trees in the hose model: the balanced case (Q867917) (← links)
- On the enrouting protocol problem under uncertainty (Q877076) (← links)
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181) (← links)
- Routing traffic at hub facilities (Q972437) (← links)
- Robust network design in telecommunications under polytope demand uncertainty (Q976502) (← links)
- Optimal oblivious routing under linear and ellipsoidal uncertainty (Q1039914) (← links)
- Network design in scarce data environment using moment-based distributionally robust optimization (Q1651520) (← links)
- Robust multiobjective optimization with application to Internet routing (Q1730555) (← links)
- Multipolar robust optimization (Q1731824) (← links)
- Path generation for affine flow thinning (Q1742256) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- Single-path routing of stochastic flows in networks (Q2275571) (← links)
- A distributed method for optimal capacity reservation (Q2322374) (← links)
- Routing strategies under demand uncertainty (Q2357923) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- New discoveries of domination between traffic matrices (Q2401765) (← links)
- Robust optimal discrete arc sizing for tree-shaped potential networks (Q2419569) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- Robust capacity assignment solutions for telecommunications networks with uncertain demands (Q2811313) (← links)
- Polynomial traffic demand polytope partitioning (Q2861541) (← links)
- Optimal routing for minimizing the maximal link congestion (Q2861545) (← links)
- Minimax models for diverse routing (Q2884526) (← links)
- Applications of meta-heuristics to traffic engineering in IP networks (Q3087845) (← links)
- Robust routing and optimal partitioning of a traffic demand polytope (Q3087849) (← links)
- IGP/MPLS hybrid IP traffic planning method under uncertain traffic matrices (Q3168408) (← links)
- Virtual Private Network Design Under Traffic Uncertainty (Q3439121) (← links)
- An approach to robust network design in telecommunications (Q3515394) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty (Q4648697) (← links)
- (Q4895137) (← links)
- A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study (Q4969341) (← links)
- (Q5111735) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5900973) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5919993) (← links)
- Affine routing for robust network design (Q6065910) (← links)