Stability of a combinatorial vector partition problem

  • Authors:

  • V. A. Emelichev;E. E. Gurevskii

  • Affiliations:

  • Belarus State University, Minsk, Belarus;Belarus State University, Minsk, Belarus

  • Venue:
  • Cybernetics and Systems Analysis
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The vector variant of the partition problem is considered. It is shown that the coincidence of the Pareto and Slater sets is the necessary and sufficient condition of stability of the problem with respect to its functional.