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...
Shranjeno v:
| izdano v: | URI:https://journals.openedition.org/msh, |
|---|---|
| Glavni avtor: | |
| Format: | Article ou chapitre numérique |
| Jezik: | Français |
| Izdano: |
Mathématiques et sciences humaines
2006
|
| Online dostop: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |