Method of ordering the values of a linear function on a set of permutations.
Електронний архів Полтавського університету економіки і торгівлі
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
Method of ordering the values of a linear function on a set of permutations.
|
|
| Creator |
Donets G. A.
Koliechkina L. |
|
| Subject |
combinatorial sets
set of permutations permutation polyhedron graphs hyperfaces Hamiltonian path |
|
| Description |
The paper deals with a new method of solving a combinatorial problem with account for the properties of the set of permutations and its structure. Using this method, the values of the linear objective function are sequenced and the set of permutations is decomposed over hyperplanes, with account of element recurrences. This makes it possible to develop an algorithm of finding the point (an element of the set of permutations) at which the objective function attains a given value. |
|
| Publisher |
Natsional\cprime naya Akademiya Nauk Ukrainy. Institut Kibernetiki im. V. M. Glushkova. Kibernetika i Sistemny\uı\ Analiz
|
|
| Date |
2016-04-04T07:09:11Z
2016-04-04T07:09:11Z 2009 |
|
| Identifier |
G. A. Donets and L. N. Kolechkina, “A method for ordering the values of a linear function on a set of permutations,” Kibernet. Sistem. Anal., vol. 45, no. 2, pp. 50–61, 187–188, 2009.
0023-1274 http://dspace.puet.edu.ua/handle/123456789/3420 |
|
| Language |
en
|
|