Aggregation approach for the minimum binary cost tension problem

Bruno Bachelet and Christophe Duhamel

European Journal of Operational Research, 2009, vol. 197, issue 2, 837-841

Abstract: The aggregation technique, dedicated to two-terminal series-parallel graphs (TTSP-graphs) and introduced lately to solve the minimum piecewise linear cost tension problem, is adapted here to solve the minimum binary cost tension problem (BCT problem). Even on TTSP-graphs, the BCT problem has been proved to be NP-complete. As far as we know, the aggregation is the only algorithm, with mixed integer programming (MIP), proposed to solve exactly the BCT problem on TTSP-graphs. A comparison of the efficiency of both methods and a heuristic is presented.

Keywords: Minimum; cost; tension; Binary; costs; Two-terminal; series-parallel; graphs (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00671-1
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:197:y:2009:i:2:p:837-841

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().