Minimum cost multiflows in undirected networks
From MaRDI portal
Publication:1337137
DOI10.1007/BF01581152zbMath0820.90040MaRDI QIDQ1337137
Publication date: 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
undirected graphedge-disjoint pathshalf-integral optimal solution\(c\)-admissible multiflowminimum cost maximum multi(commodity) flow problempseudo- polynomial algorithm
Related Items
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity, On a general framework for network representability in discrete optimization, Multiflows and disjoint paths of minimum total cost, Min-cost multiflows in node-capacitated undirected networks, Cost minimizing planning of container inspection and repair in multiple facilities, Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees, Unnamed Item, A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem, L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem, Discrete Convex Functions on Graphs and Their Algorithmic Applications, Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation, Path problems in skew-symmetric graphs, A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
Cites Work
- A strongly polynomial minimum cost circulation algorithm
- Polyhedra related to undirected multicommodity flows
- Geometric algorithms and combinatorial optimization
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Finding minimum-cost circulations by canceling negative cycles
- Polynomial algorithms in linear programming
- On some connectivity properties of Eulerian graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
