Multiflows and disjoint paths of minimum total cost
From MaRDI portal
(Redirected from Publication:1373749)
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 4204092 (Why is no real title available?)
- scientific article; zbMATH DE number 19806 (Why is no real title available?)
- scientific article; zbMATH DE number 3231691 (Why is no real title available?)
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Dominants and submissives of matching polyhedra
- Feasibility of Two Commodity Network Flows
- Geometric algorithms and combinatorial optimization
- Matching, Euler tours and the Chinese postman
- Matroid matching and some applications
- Maximum matching and a polyhedron with 0,1-vertices
- Minimum cost multiflows in undirected networks
- Minimum weight (T,d)-joins and multi-joins
- Multi-Commodity Network Flows
- Network flows. Theory, algorithms, and applications.
- On some connectivity properties of Eulerian graphs
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the computational behavior of a polynomial-time network flow algorithm
- On the surface duality of linear graphs
- Polynomial algorithms in linear programming
- Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Über die Maximalzahl kantendisjunkter A-Wege
- Über die Maximalzahl kreuzungsfreier H-Wege
Cited in
(15)- Multicommodity network flows: A survey. II: Solution methods
- 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
- Integral flow decomposition with minimum longest path length
- scientific article; zbMATH DE number 7121921 (Why is no real title available?)
- Tree metrics and edge-disjoint \(S\)-paths
- Integrality in the multinetwork min‐cost equal‐flow problem
- 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
- Min-cost multiflows in node-capacitated undirected networks
- scientific article; zbMATH DE number 6161596 (Why is no real title available?)
- Minimum weight (T,d)-joins and multi-joins
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)
