| Article ID: | iaor20052711 |
| Country: | France |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 101 |
| End Page Number: | 108 |
| Publication Date: | Jan 2002 |
| Journal: | RAIRO Operations Research |
| Authors: | Petitjean Michel |
The signed similarities aggregation problem is solved with a boolean method derived from the Faure and Malgrange algorithm. The method is adequate either for integer similarities or real similarities, and multiple solutions can be enumerated. It needs a space amount equal to three times the input data size.