A strongly polynomial algorithm for the minimum cost tension problem
type: Item
instance of: scholarly article
title: A strongly polynomial algorithm for the minimum cost tension problem
zbMATH Open document ID: 0873.90101
DOI: 10.1016/S0012-365X(96)00185-9
author: Malika Hadjiat
author: Jean-François Maurras
published in: Discrete Mathematics
publication date: 1997-10-30T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1019109
zbMATH Keywords: strongly polynomial algorithm
zbMATH Keywords: minimum cost tension problem
zbMATH Keywords: min-mean-cost residual cut problems
MaRDI profile type: Publication
cites work: Minimum cuts, modular functions, and matroid polyhedra
cites work: Flots et tensions dans un graphe
cites work: Finding minimum-cost circulations by canceling negative cycles
cites work: Miu Cost Tensions
cites work: A characterization of the minimum cycle mean in a digraph
cites work: Q4886036
cites work: Q4763402
cites work: Q4077762
cites work: An “out-of-kilter” algorithm for solving minimum cost potential problems
cites work: Q4228440
cites work: Q3730336
cites work: A strongly polynomial minimum cost circulation algorithm
Wikidata QID: Q127646320
description: scientific article; zbMATH DE number 1019109