Maximum Throughput Network Routing Subject to Fair Flow Allocation

DOI10.1007/978-3-319-09174-7_1zbMath1445.90015OpenAlexW102903495MaRDI QIDQ3195309

Stefano Coniglio, Edoardo Amaldi, Leonardo Taccari

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_1

zbMATH Keywords

fairnesscomputational complexityinteger programmingnetworksrouting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Flows in graphs (05C21)

Related Items

Integer programming formulations for the elementary shortest path problem, An approximation to max min fairness in multi commodity networks, A Unified Framework for Multistage Mixed Integer Linear Optimization, Optimal flow and capacity allocation in multiple joint quickest paths of directed networks

Cites Work

• Unnamed Item
• Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
• The directed subgraph homeomorphism problem
• Max-min fairness in multi-commodity flows
• Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
• Upward Max-Min Fairness
• Optimal flows in networks with multiple sources and sinks
• Fairness in routing and load balancing