Aggregation approach for the minimum binary cost tension problem

DOI10.1016/J.EJOR.2008.07.033zbMATH Open1159.90493OpenAlexW2091475925MaRDI QIDQ1015014FDOQ1015014

Authors: 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

Recommendations

• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs
• Miu Cost Tensions
• Penelope's graph: a hard minimum cost tension instance
• scientific article; zbMATH DE number 35513

zbMATH Keywords

binary costsminimum cost tensiontwo-terminal series-parallel graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• The Recognition of Series Parallel Digraphs
• 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
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1

Cited In (5)

• 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
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015014)