An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem
From MaRDI portal
Publication:2424659
DOI10.1007/s10878-018-0331-5zbMath1426.90245OpenAlexW2887154986MaRDI QIDQ2424659
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0331-5
Cites Work
- Unnamed Item
- Unnamed Item
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
- Aggregation approach for the minimum binary cost tension problem
- Scaling algorithms for network problems
- Penelope's graph: a hard minimum cost tension instance
- A strongly polynomial algorithm for the minimum cost tension problem
- Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem
- Solving the Convex Cost Integer Dual Network Flow Problem
- Finding Minimum-Cost Circulations by Successive Approximation
- Miu Cost Tensions
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- Fibonacci heaps and their uses in improved network optimization algorithms
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Flots et tensions dans un graphe
- An “out-of-kilter” algorithm for solving minimum cost potential problems
