Multiflows and disjoint paths of minimum total cost
From MaRDI portal
Publication:1373749
DOI10.1007/BF02614372zbMath0889.90064MaRDI QIDQ1373749
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Minimum weight \((T,d)\)-joins and multi-joins, Finding Maximum Edge-Disjoint Paths Between Multiple Terminals, Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees, Unnamed Item, Tree metrics and edge-disjoint \(S\)-paths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid matching and some applications
- On the computational behavior of a polynomial-time network flow algorithm
- Geometric algorithms and combinatorial optimization
- Über die Maximalzahl kantendisjunkter A-Wege
- Über die Maximalzahl kreuzungsfreier H-Wege
- Minimum cost multiflows in undirected networks
- Minimum weight \((T,d)\)-joins and multi-joins
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Polynomial algorithms in linear programming
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- On some connectivity properties of Eulerian graphs
- On the Complexity of Timetable and Multicommodity Flow Problems
- Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
- Dominants and submissives of matching polyhedra
- Matching, Euler tours and the Chinese postman
- On the surface duality of linear graphs
- Maximum matching and a polyhedron with 0,1-vertices
- Feasibility of Two Commodity Network Flows
- Multi-Commodity Network Flows
