|
This article is cited in 9 scientific papers (total in 9 papers)
Analysis of the sensitivity of efficient solutions of a vector problem of minimizing linear forms on a set of permutations
V. A. Emelichev, V. G. Pokhil'ko
Abstract:
We consider a multicriteria formulation of the well-known
combinatorial problem to minimise a linear form over an arbitrary
set of permutations of the symmetric group.
We give bounds (in the Chebyshev metric) for the coefficients
of the linear forms preserving the corresponding efficiency
of an arbitrary solution that is Pareto-, Slater-, or Smale-optimal.
We present some conditions
guaranteeing that a permutation possessing the efficiency property
is locally stable. The class of quasi-stable problems is described.
Received: 24.06.2000
Citation:
V. A. Emelichev, V. G. Pokhil'ko, “Analysis of the sensitivity of efficient solutions of a vector problem of minimizing linear forms on a set of permutations”, Diskr. Mat., 12:3 (2000), 37–48; Discrete Math. Appl., 10:4 (2000), 367–378
Linking options:
https://www.mathnet.ru/eng/dm339https://doi.org/10.4213/dm339 https://www.mathnet.ru/eng/dm/v12/i3/p37
|
Statistics & downloads: |
Abstract page: | 743 | Full-text PDF : | 254 | References: | 57 | First page: | 3 |
|