Aggregation approach for the minimum binary cost tension problem

DOI10.1016/j.ejor.2008.07.033zbMath1159.90493OpenAlexW2091475925MaRDI QIDQ1015014

Bruno Bachelet, Christophe Duhamel

Publication date: 30 April 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.07.033

zbMATH Keywords

minimum cost tensionbinary coststwo-terminal series-parallel graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (3)

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 ⋮ An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem

Cites Work

• A strongly polynomial algorithm for the minimum cost tension problem
• Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs
• Solving the Convex Cost Integer Dual Network Flow Problem
• The Recognition of Series Parallel Digraphs
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1

This page was built for publication: Aggregation approach for the minimum binary cost tension problem