Voir la notice de l'article provenant de la source Numdam
We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in operations.
@article{RO_2003__37_4_221_0, author = {Bachelet, Bruno and Mahey, Philippe}, title = {Minimum convex-cost tension problems on series-parallel graphs}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {221--234}, publisher = {EDP-Sciences}, volume = {37}, number = {4}, year = {2003}, doi = {10.1051/ro:2004202}, mrnumber = {2064599}, zbl = {1101.68715}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.1051/ro:2004202/} }
TY - JOUR AU - Bachelet, Bruno AU - Mahey, Philippe TI - Minimum convex-cost tension problems on series-parallel graphs JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2003 SP - 221 EP - 234 VL - 37 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro:2004202/ DO - 10.1051/ro:2004202 LA - en ID - RO_2003__37_4_221_0 ER -
%0 Journal Article %A Bachelet, Bruno %A Mahey, Philippe %T Minimum convex-cost tension problems on series-parallel graphs %J RAIRO - Operations Research - Recherche Opérationnelle %D 2003 %P 221-234 %V 37 %N 4 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro:2004202/ %R 10.1051/ro:2004202 %G en %F RO_2003__37_4_221_0
Bachelet, Bruno; Mahey, Philippe. Minimum convex-cost tension problems on series-parallel graphs. RAIRO - Operations Research - Recherche Opérationnelle, Tome 37 (2003) no. 4, pp. 221-234. doi: 10.1051/ro:2004202
Cité par Sources :