Optimal routing for minimizing the maximal link congestion

zbMATH Open1274.90044MaRDI QIDQ2861545FDOQ2861545

Authors: Olivier Klopfenstein, Hassan Hijazi 

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001460

Recommendations

• Single-path routing of stochastic flows in networks
• scientific article; zbMATH DE number 4057261
• Optimal Flows in Stochastic Dynamic Networks with Congestion
• Optimal oblivious routing under linear and ellipsoidal uncertainty
• Single-Source Stochastic Routing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• On Nonlinear Fractional Programming
• Title not available (Why is that?)
• An algorithmic framework for convex mixed integer nonlinear programs
• Routing of uncertain traffic demands
• An approach to robust network design in telecommunications
• Title not available (Why is that?)
• Algorithms for generalized fractional programming
• Robust capacity assignment in telecommunications
• A survey on statistical bandwidth sharing
• Chance-constrained stochastic programming for integrated services network management
• Multi-layer MPLS network design: The impact of statistical multiplexing
• Evolving system architectures for multimedia network design

Cited In (8)

• Minimax models for diverse routing
• Single-Source Stochastic Routing
• Title not available (Why is that?)
• High-performance heuristics for optimization in stochastic traffic engineering problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Single-path routing of stochastic flows in networks
• Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks

Uses Software

• Bonmin

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)