Miu Cost Tensions
From MaRDI portal
Recommendations
- A strongly polynomial algorithm for the minimum cost tension problem
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem
Cites work
- Algebraic flows in regular matroids
- An “out-of-kilter” algorithm for solving minimum cost potential problems
- Converting Linear Programs to Network Problems
- Decomposition of group flows in regular matroids
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- Minimal cost flows in regular matroids
Cited in
(11)- Aggregation approach for the minimum binary cost tension problem
- Penelope's graph: a hard minimum cost tension instance
- A strongly polynomial algorithm for the minimum cost tension problem
- Inessential tensions
- 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
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem
- scientific article; zbMATH DE number 3976734 (Why is no real title available?)
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem
- scientific article; zbMATH DE number 3993255 (Why is no real title available?)
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
This page was built for publication: Miu Cost Tensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735408)
