Optimal routing for minimizing the maximal link congestion
From MaRDI portal
Publication:2861545
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 932427 (Why is no real title available?)
- A survey on statistical bandwidth sharing
- Algorithms for generalized fractional programming
- An algorithmic framework for convex mixed integer nonlinear programs
- An approach to robust network design in telecommunications
- Chance-constrained stochastic programming for integrated services network management
- Evolving system architectures for multimedia network design
- Multi-layer MPLS network design: The impact of statistical multiplexing
- On Nonlinear Fractional Programming
- Robust capacity assignment in telecommunications
- Routing of uncertain traffic demands
Cited in
(8)- Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
- Minimax models for diverse routing
- Single-Source Stochastic Routing
- scientific article; zbMATH DE number 4057261 (Why is no real title available?)
- High-performance heuristics for optimization in stochastic traffic engineering problems
- scientific article; zbMATH DE number 934460 (Why is no real title available?)
- scientific article; zbMATH DE number 1594568 (Why is no real title available?)
- Single-path routing of stochastic flows in networks
This page was built for publication: Optimal routing for minimizing the maximal link congestion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861545)