Multiflows and disjoint paths of minimum total cost
type: Item
instance of: scholarly article
title: Multiflows and disjoint paths of minimum total cost
zbMATH Open document ID: 0889.90064
DOI: 10.1007/BF02614372
author: Alexander V. Karzanov
published in: Mathematical Programming. Series A. Series B
publication date: 1997-11-25T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1091311
zbMATH Keywords: multicommodity flows
zbMATH Keywords: minimum cost multiflows
zbMATH Keywords: edge-disjoint paths
zbMATH Keywords: undirected network
MaRDI profile type: Publication
cites work: Q3056948
cites work: On the computational behavior of a polynomial-time network flow algorithm
cites work: Minimum weight \((T,d)\)-joins and multi-joins
cites work: Dominants and submissives of matching polyhedra
cites work: On the surface duality of linear graphs
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Matching, Euler tours and the Chinese postman
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q3292914
cites work: Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
cites work: Q3352816
cites work: Geometric algorithms and combinatorial optimization
cites work: Q5519709
cites work: Multi-Commodity Network Flows
cites work: Q3979310
cites work: Minimum cost multiflows in undirected networks
cites work: Polynomial algorithms in linear programming
cites work: On some connectivity properties of Eulerian graphs
cites work: Matroid matching and some applications
cites work: Über die Maximalzahl kantendisjunkter A-Wege
cites work: Über die Maximalzahl kreuzungsfreier H-Wege
cites work: Feasibility of Two Commodity Network Flows
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
description: scientific article; zbMATH DE number 1091311