Search
Decomposition Approach to Minimize a Class of Superposition of Recurrent Monotone Functions on a Set of Parameterized Paths in Digraph
Citation
Guschinsky, N. Decomposition Approach to Minimize a Class of Superposition of Recurrent Monotone Functions on a Set of Parameterized Paths in Digraph / N. Guschinsky, G. Levin // International Conference on Neural Networks and Artificial Intelligence ICNNAI’99 = Международная конференция по нейронным сетям и искусственному интеллекту ICNNAI’99 : Proceedings, Brest, Belarus, 12–15 October 1999 / Brest Polytechnic Institute, Department of Computers and Laboratory of Artificial Neural Networks, Belarus Special Interest Group of International Neural NetWork Society, International Neural NetWork Society, Belarusian State University of Informatics and Radioelectronics (Belarus), Belarusian Academy of Sciences, Institute of Engineering Cybemetics (Belarus), Universidad Politechnica de Valencia (Spain), Institute of Computer Information Technologies (Ukraine, Ternopil) ; ed. V. Golovko. – Brest : BPI, 1999. – P. 210–213.Abstract
A problem of finding optimal parameterized path in digraph is considered. A parameterized path is a path each arc of which is assigned a parameter fforn a given set. A superposition of recurrent-monotone functions is accepted as an objective fimction where one of the functions is defined by using max operation. A twolevel decomposition scheme for solving an initial problem is proposed. Methods for solving the obtained after decomposition subproblems are developed.
Collection
Это произведение доступно по лицензии Creative Commons «Attribution-NonCommercial» («Атрибуция-Некоммерчески») 4.0 Всемирная.