1. Donec, G.A., Kolechkina, L.M.: Construction of Hamiltonian paths in graphs of permutation polyhedra. Cybern. Syst. Anal. 46(1), 7–13 (2010).
https://doi.org/10.1007/s10559-010-9178-1
2. Donec, G.A., Kolechkina, L.M.: Extremal Problems on Combinatorial Configurations. RVV PUET, Poltava (2011)
3. Donets, G.A., Kolechkina, L.N.: Method of ordering the values of a linear function on a set of permutations. Cybern. Syst. Anal. 45(2), 204–213 (2009).
https://doi.org/10.1007/s10559-009-9092-6
4. Gimadi, E., Khachay, M.: Extremal Problems on Sets of Permutations. Ural Federal University, Yekaterinburg (2016). [in Russian]
5. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin, New York (2010)