Minimum cost multiflows in undirected networks
type: Item
instance of: scholarly article
title: Minimum cost multiflows in undirected networks
zbMATH Open document ID: 0820.90040
DOI: 10.1007/BF01581152
author: Alexander V. Karzanov
published in: Mathematical Programming. Series A. Series B
publication date: 1994-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 679578
zbMATH Keywords: edge-disjoint paths
zbMATH Keywords: undirected graph
zbMATH Keywords: minimum cost maximum multi(commodity) flow problem
zbMATH Keywords: \(c\)-admissible multiflow
zbMATH Keywords: pseudo- polynomial algorithm
zbMATH Keywords: half-integral optimal solution
MaRDI profile type: Publication
cites work: Q4149476
cites work: Q3292914
cites work: Q3352816
cites work: Finding minimum-cost circulations by canceling negative cycles
cites work: Geometric algorithms and combinatorial optimization
cites work: Q3979310
cites work: Polyhedra related to undirected multicommodity flows
cites work: Polynomial algorithms in linear programming
cites work: On some connectivity properties of Eulerian graphs
cites work: A strongly polynomial minimum cost circulation algorithm
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
description: scientific article; zbMATH DE number 679578