Summation of the Enumerators in the Discrete Optimization Problems
Author(s):
Sergey Kuznetsov
Unidata LLC
Saint-Petersburg State University
sergey.kouznetsov@gmail.com
Dmitrii Koznov
Saint-Petersburg State University
d.koznov@spbu.ru
Abstract:
The publication presents an approach to the use of discrete optimization algorithms, in particular, the search for suboptimal solutions. The theory of enumerators, proposed by the famous Leningrad mathematician I.V. Romanovsky, and the operation of their summation, which is proposed to be used to create multi-domain suboptimal algorithms, are considered. The paper presents an efficient algorithm to sum enumerators based on the recalculation of the Pareto boundary. Motivations for using the proposed algorithm within the framework of a well-known task in the field of Master Data Management are given.
Keywords
- discrete optimization
- enumerators
- master data management
- multi-domain algorithms
- Pareto boundary
- suboptimal problems
References:
- Romanovsky J. V. Suboptimal solutions. Petrozavodsk: Petrozavodsk University Publishing House. 1998 (in Russian)
- Brumstein Y. M., Tarkov D. A., Dyudikov I. A. The models and methods analysis of optimum choice for decisions sets in conditions of resource restrictions and risks // Caspian Journal: Management and High Technologies, 2013, 3 (23), 169-180
- Kuznetsov S., Konstantinov A., Skvortsov N. The value of your data, Alpina PRO Publishing House, 2022 (in Russian)
- Kuznetsov, S.V. Summation of the enumerators in the discrete optimization problems, Differencialnie Uravnenia i Protsesy Upravlenia, No. 4, 2023, 42-52
- Romanovsky J. V., Kuznetsov S. V. A generalized algorithm for summing enumerators of suboptimal solutions // Vestnik of Saint Petersburg University. Series 1. Mathematics. Mechanics. Astronomy, 2005, 2, pp. 74-87 (in Russian).
- Marler R. T., Arora J. S. Survey of multi-objective optimization methods for engineering // Structural and multidisciplinary optimization. - 2004. - Т. 26. - С. 369-395
- Denardo E. V., Fox B. L. Shortest-route methods: reaching, pruning, and buckets // Operations Research. 1979. Vol. 27. P. 161-186
