Multiflows and disjoint paths of minimum total cost
From MaRDI portal
Publication:1373749
DOI10.1007/BF02614372zbMATH Open0889.90064MaRDI QIDQ1373749FDOQ1373749
Authors: Alexander V. Karzanov 
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Matching, Euler tours and the Chinese postman
- Polynomial algorithms in linear programming
- Maximum matching and a polyhedron with 0,1-vertices
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the computational behavior of a polynomial-time network flow algorithm
- Title not available (Why is that?)
- Feasibility of Two Commodity Network Flows
- Multi-Commodity Network Flows
- Matroid matching and some applications
- Über die Maximalzahl kreuzungsfreier H-Wege
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Über die Maximalzahl kantendisjunkter A-Wege
- On some connectivity properties of Eulerian graphs
- On the surface duality of linear graphs
- Minimum cost multiflows in undirected networks
- Title not available (Why is that?)
- Dominants and submissives of matching polyhedra
- Minimum weight \((T,d)\)-joins and multi-joins
- Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
Cited In (15)
- On minimum reload cost paths, tours, and flows
- On extremal multiflows
- Flows on few paths: Algorithms and lower bounds
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
- Title not available (Why is that?)
- Integral flow decomposition with minimum longest path length
- Integrality in the multinetwork min‐cost equal‐flow problem
- Tree metrics and edge-disjoint \(S\)-paths
- Flows over edge-disjoint mixed multipaths and applications
- Minimum cost multiflows in undirected networks
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
- Title not available (Why is that?)
- Min-cost multiflows in node-capacitated undirected networks
- Minimum weight \((T,d)\)-joins and multi-joins
- Multicommodity network flows: A survey. II: Solution methods
This page was built for publication: Multiflows and disjoint paths of minimum total cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373749)
