Vainqueurs de Kemeny et tournois difficiles
In this paper, we deal with the computation of median orders of weighted tournaments. First, we present improvements of a branch and bound method in order to speed up the enumeration of median orders. Then, for the hard tournaments for which these improvements are not sufficient, we study two ways t...
Zapisane w:
| Wydane w: | URI:https://journals.openedition.org/msh, |
|---|---|
| 1. autor: | |
| Format: | Article ou chapitre numérique |
| Język: | Français |
| Wydane: |
Mathématiques et sciences humaines
2006
|
| Dostęp online: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |
| Streszczenie: | In this paper, we deal with the computation of median orders of weighted tournaments. First, we present improvements of a branch and bound method in order to speed up the enumeration of median orders. Then, for the hard tournaments for which these improvements are not sufficient, we study two ways to reduce the tournament by deleting vertices which appear as poor candidates. |
|---|