Minimum Convex Piecewise Linear Cost Tension Problem on Quasi-k Series-Parallel Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue 4OR: A Quarterly Journal of Operations Research Année : 2004

Minimum Convex Piecewise Linear Cost Tension Problem on Quasi-k Series-Parallel Graphs

Résumé

This article proposes an extension, combined with the out-of-kilter technique, of the aggregation method (that solves the minimum convex piecewise linear cost tension problem, or CPLCT, on series-parallel graphs) to solve CPLCT on quasi series-parallel graphs. To make this algorithm efficient, the key point is to find a "good" way of decomposing the graph into series-parallel subgraphs. Decomposition techniques, based on the recognition of series-parallel graphs, are thoroughly discussed.
Fichier principal
Vignette du fichier
RR-03-19.pdf (211.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00107057 , version 1 (16-01-2019)

Identifiants

Citer

Bruno Bachelet, Philippe Mahey. Minimum Convex Piecewise Linear Cost Tension Problem on Quasi-k Series-Parallel Graphs. 4OR: A Quarterly Journal of Operations Research, 2004, 2 (4), pp.275-291. ⟨10.1007/s10288-004-0049-3⟩. ⟨hal-00107057⟩
75 Consultations
72 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More