Designing Least-Cost Nonblocking Broadband Networks
From MaRDI portal
Publication:4360132
Recommendations
Cited in
(36)- Competitive and deterministic embeddings of virtual networks
- Topological design and dimensioning of agile all-photonic networks
- On maximum-sum matchings of points
- Design of trees in the hose model: the balanced case
- Robust combinatorial optimization with knapsack uncertainty
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
- Computational Geometry Column 34
- Fast, efficient equipment placement heuristics for broadband switched or internet router net\-works
- Robust routing and optimal partitioning of a traffic demand polytope
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Single-sink fractionally subadditive network design
- Multipolar robust optimization
- Single-commodity robust network design with finite and hose demand sets
- On the robustness of potential-based flow networks
- Polynomial traffic demand polytope partitioning
- Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty
- On the approximability of robust network design
- A capacitated hub location problem under hose demand uncertainty
- Center of maximum-sum matchings of bichromatic points
- Robust optimal discrete arc sizing for tree-shaped potential networks
- A note on hierarchical hubbing for a generalization of the VPN problem
- Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
- Exploring the tractability of the capped hose model
- Network design with a discrete set of traffic matrices
- A comparison of routing sets for robust network design
- Static and dynamic routing under disjoint dominant extreme demands
- Robust network design: formulations, valid inequalities, and computations
- On improving optimal oblivious routing
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty
- Affine routing for robust network design
- New discoveries of domination between traffic matrices
- Generalized hose uncertainty in single-commodity robust network design
- The robust network loading problem with dynamic routing
- A mathematical framework for designing a low-loss, low-delay internet
- A mathematical model and related problems of optimal management and design in a broadband integrated services network
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
This page was built for publication: Designing Least-Cost Nonblocking Broadband Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4360132)
