|
Descripción
|
|
|---|---|
| A binary relation R does not always possess the desirable property of transitivity. Consequently, this needs to be imposed artificially by deviating as little as possible from R. In this paper, three approaches to transitive approximation are analyzed within a common distance-based framework: exterior (transitive closure), interior (openings or maximal transitive sub-relations contained in R) and mixed (transitive fittings) approximation. Additionally, we propose a method for obtaining all these transitive approximations. The method is based on a distance function optimization framework that leads to straightforward goal programming models | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
ANNALS OF OPERATIONS RESEARCH |
|
ISSN
|
0254-5330 |
|
Factor de impacto JCR
|
0,544 |
|
Información de impacto
|
|
|
Volumen
|
163 |
|
DOI
|
|
|
Número de revista
|
0 |
|
Desde la página
|
197 |
|
Hasta la página
|
208 |
|
Mes
|
ENERO |
|
Ranking
|
|