Maximum throughput network routing subject to fair flow allocation
From MaRDI portal
Recommendations
Cites work
- Fairness in routing and load balancing
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
- Max-min fairness in multi-commodity flows
- Optimal flows in networks with multiple sources and sinks
- The directed subgraph homeomorphism problem
- Upward max-min fairness
Cited in
(8)- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
- An approximation to max min fairness in multi commodity networks
- Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis
- Max-min fairness in multi-commodity flows
- scientific article; zbMATH DE number 2088538 (Why is no real title available?)
- Linear max-min fairness in multi-commodity flow networks
- Integer programming formulations for the elementary shortest path problem
- A unified framework for multistage mixed integer linear optimization
This page was built for publication: Maximum throughput network routing subject to fair flow allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195309)