| Article ID: | iaor19921529 |
| Country: | United Kingdom |
| Volume: | 29 |
| Start Page Number: | 117 |
| End Page Number: | 125 |
| Publication Date: | Feb 1989 |
| Journal: | USSR Computational Mathematics and Mathematical Physics |
| Authors: | Emelichev V.A. |
| Keywords: | graphs |
The problem of finding the set of alternatives for multicriterion problems of matchings, paths, and chains on a graph is considered. A probabilistic analysis of the computational complexity of the problem is performed and the effectiveness of algorithms based on linear scalarization of the criteria is considered.