An “out-of-kilter” algorithm for solving minimum cost potential problems

DOI10.1007/BF01584092zbMath0262.90061MaRDI QIDQ5678677

Jean-Marie Pla

Publication date: 1971

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A strongly polynomial algorithm for the minimum cost tension problem ⋮ Miu Cost Tensions ⋮ 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 ⋮ An improved version of the out-of-kilter method and a comparative study of computer codes ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1

Cites Work

• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• Unnamed Item
• Unnamed Item