This article presents the modeling and optimization methods for a new kind of synchronization problems arising in the field of hypermedia presentations. It is shown that they can be seen as tension problems in graphs. Two of them are described in detail: the minimum cost tension problem and its discrete cost counterpart. The former is solved with pseudo-polynomial or polynomial methods. The latter is NP-complete and we discuss ways to improve its minimal and maximal objective bounds.