Aggregation Approach for the Minimum Binary Cost Tension Problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2009

Aggregation Approach for the Minimum Binary Cost Tension Problem

Résumé

The aggregation technique, dedicated to two-terminal series-parallel graphs (or 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 (or 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, proposed to solve exactly the BCT problem on TTSP-graphs. A comparison of the efficiency of both methods is presented here.
Fichier principal
Vignette du fichier
RR-04-08.pdf (136.03 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01703322 , version 1 (08-02-2018)

Identifiants

Citer

Bruno Bachelet, Christophe Duhamel. Aggregation Approach for the Minimum Binary Cost Tension Problem. European Journal of Operational Research, 2009, 197 (2), pp.837-841. ⟨10.1016/j.ejor.2008.07.033⟩. ⟨hal-01703322⟩
73 Consultations
80 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More