Pages that link to "Item:Q4360132"
From MaRDI portal
The following pages link to Designing Least-Cost Nonblocking Broadband Networks (Q4360132):
Displayed 33 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Competitive and deterministic embeddings of virtual networks (Q391268) (← 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)
- Static and dynamic routing under disjoint dominant extreme demands (Q631210) (← links)
- Dynamic vs. oblivious routing in network design (Q634684) (← links)
- On improving optimal oblivious routing (Q833579) (← links)
- Design of trees in the hose model: the balanced case (Q867917) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
- Multipolar robust optimization (Q1731824) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- A note on hierarchical hubbing for a generalization of the VPN problem (Q1785741) (← links)
- Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors (Q1928497) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty (Q2106728) (← links)
- Generalized hose uncertainty in single-commodity robust network design (Q2182776) (← 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)
- On maximum-sum matchings of points (Q2679241) (← links)
- On the robustness of potential-based flow networks (Q2689822) (← links)
- (Q2861541) (← links)
- Robust routing and optimal partitioning of a traffic demand polytope (Q3087849) (← links)
- Computational Geometry Column 34 (Q4513228) (← links)
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty (Q4648697) (← links)
- Exploring the Tractability of the Capped Hose Model (Q5111705) (← links)
- (Q5111735) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Affine routing for robust network design (Q6065910) (← links)
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty (Q6168886) (← links)
- Center of maximum-sum matchings of bichromatic points (Q6177424) (← links)