Penelope's graph: a hard minimum cost tension instance
From MaRDI portal
Publication:1127551
DOI10.1016/S0304-3975(97)00186-2zbMath0912.68007MaRDI QIDQ1127551
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (5)
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 ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1
Cites Work
- Unnamed Item
- Unnamed Item
- A strongly polynomial minimum cost circulation algorithm
- Penelope's graph: a hard minimum cost tension instance
- A strongly polynomial algorithm for the minimum cost tension problem
- Monotone networks
- Finding minimum-cost circulations by canceling negative cycles
- Miu Cost Tensions
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A bad network problem for the simplex method and other minimum cost flow algorithms
- Paths, Trees, and Flowers
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- Flots et tensions dans un graphe
- On some techniques useful for solution of transportation network problems
- An “out-of-kilter” algorithm for solving minimum cost potential problems
This page was built for publication: Penelope's graph: a hard minimum cost tension instance
