Optimal routing for multiclass networks
From MaRDI portal
Publication:666417
DOI10.1155/2011/645954zbMath1233.90082DBLPjournals/advor/KamedaLA11OpenAlexW2039769799WikidataQ57691382 ScholiaQ57691382MaRDI QIDQ666417
Hisao Kameda, Eitan Altman, Jie Li
Publication date: 8 March 2012
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/645954
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Potential games
- On the convergence of descent methods for monotone variational inequalities
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Braess-like paradoxes in distributed computer systems
- Mathematical Optimization and Economic Theory
- Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
- Optimal static load balancing in distributed computer systems
- A Minimum Delay Routing Algorithm Using Distributed Computation
- The flow deviation method: An approach to store‐and‐forward communication network design
- Convex Analysis
- Traffic assignment problem for a general network
This page was built for publication: Optimal routing for multiclass networks
