Miu Cost Tensions

DOI10.1080/02522667.1985.10698828zbMath0599.90030OpenAlexW2037771289MaRDI QIDQ3735408

Horst W. Hamacher

Publication date: 1985

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1985.10698828

zbMATH Keywords

capacitated network flowsmin cost tension problemnegative cut algorithmshortest augmenting cut algorithmtotally unimodular linear programs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

A strongly polynomial algorithm for the minimum cost tension problem ⋮ A faster strongly polynomial time algorithm to solve the minimum cost tension problem ⋮ Penelope's graph: a hard minimum cost tension instance ⋮ An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem ⋮ An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem

Cites Work

• Unnamed Item
• Algebraic flows in regular matroids
• Decomposition of group flows in regular matroids
• Converting Linear Programs to Network Problems
• Minimal cost flows in regular matroids
• An “out-of-kilter” algorithm for solving minimum cost potential problems

This page was built for publication: Miu Cost Tensions