Convex extensions on combinatorial configurations

C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Mineola, NY: Dover Publications, 1998.

B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms. 6th ed. Springer, 2018. doi: 10.1007/978-3-662-56039-6

A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003. doi: 10.1007/978-3-662-55694-8

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. Wiley, 1988.

L. A. Wolsey, Integer Programming, 2nd ed. Wiley, 2021.

P. M. Pardalos, D.-Z. Du, and R. L. Graham, Eds, Handbook of Combinatorial Optimization. 2nd ed. Springer, 2013.

I. V. Sergienko, Mathematical Models and Methods for Solving Discrete Optimization Problems. Naukova Dumka, Kyiv, 1988.

I. V. Sergienko, L. F. Hulianytskyi, and S. I. Sirenko, “Classification of applied methods for combinatorial optimization,” Cybern. Syst. Anal., vol. 45, no. 5, pp. 732–741, 2009. doi: 10.1007/s10559-009-9134-0

I. V. Sergienko, V. P. Shilo, and V. O. Roshchin, Discrete Optimization. Algorithms and Their Effective Use. Naukova Dumka, Kyiv, 2020.

L. Hulianytskyi and I. Riasna, “Formalization and Classification of Combinatorial Optimizaion Problems,” in Optimization Methods and Applications. Springer, 2017, pp. 239–250. doi: 10.1007/978-3-319-68640-0_11

L. F. Hulianytskyi and I. V. Sergienko, “Metaheuristic downhill simplex method in combinatorial optimization,” Cybern. Syst. Anal., vol. 44, no. 3, pp. 822–829, 2008. doi: 10.1007/s10559-007-0106-y

P. I. Stetsyuk, “Scientific Legacy of Academician N. Z. Shor,” Cybern. Syst. Anal., vol. 61, 2025. doi: 10.1007/s10559-025-00796-6

L. F. Hulianytskyi and O. Yu. Mulesa, Applied Methods of Combinatorial Optimization. Publishing and Printing Center “Kyiv University”, Kyiv, 2016.

G. O. Donets and L. M. Koliechkina, Extremal Problems on Combinatorial Configurations. RVV PUET, Poltava, 2011.

M. Z. Zgurovsky and A. A. Pavlov, Hard Combinatorial Optimization Problems in Planning and Decision Making. Naukova Dumka, Kyiv, 2016.

S. Butenko, P. M. Pardalos, and V. Shylo, Eds, Optimization Methods and Applications: In Honor of Ivan V. Sergienko’s 80th Birthday. Springer, 2017. doi: 10.1007/978-3-319-68640-0

I. V. Kozin, Evolutionary Models in Discrete Optimization. Zaporizhzhia National University, 2017.

C. Berge, Principes de combinatoire. Dunod, Paris, 1968.

Yu. G. Stoyan, “Some properties of special combinatorial sets,” Preprint No. 85, Institute of Mechanical Engineering Problems, Kharkiv, 1980.

Yu. G. Stoyan, “On one mapping of combinatorial sets in Euclidean space,” Preprint No. 173, Institute of Mechanical Engineering Problems, Kharkiv, 1982.

Yu. G. Stoyan and S. V. Yakovlev, Mathematical Models and Optimization Methods of Geometric Design. Naukova Dumka, Kyiv, 1986.

Y. G. Stoyan and S. V. Yakovlev, “Theory and methods of Euclidean combinatorial optimization: current status and prospects,” Cybern. Syst. Anal., vol. 56, no. 3, pp. 366–379, 2020. doi: 10.1007/s10559-020-00253-6

S. V. Yakovlev, “Bounds on the minimum of convex functions on Euclidean combinatorial sets,” Cybernetics, vol. 25, no. 3, pp. 385–391, 1989. doi: 10.1007/BF01069996

S. V. Yakovlev, “The theory of convex continuations of functions on vertices of convex polyhedra,” Comp. Math. and Math. Phys., vol. 34, pp. 1112–1119, 1994.

S. Yakovlev, “Convex extensions in combinatorial optimization and their applications,” in Optimization Methods and Applications. Springer, 2017, pp. 567–584. doi: 10.1007/978-3-319-68640-0_27

Yu. G. Stoyan, S. V. Yakovlev, and O. S. Pichugina, Euclidean Combinatorial Configurations: Monograph. Constanta, Kharkiv, 2017.

O. S. Pichugina and S. V. Yakovlev, Continuous Functional Representations in Discrete Optimization Problems: Monograph. Golden Mile, Kharkov, 2018.

S. V. Yakovlev and O. S. Pichugina, “Properties of combinatorial optimization problems over polyhedral-spherical sets,” Cybern. Syst. Anal., vol. 54, no. 1, pp. 99–109, 2018. doi: 10.1007/s10559-018-0011-6

O. Pichugina and S. Yakovlev, “Euclidean combinatorial configurations: continuous representations and convex extensions,” in Advances in Intelligent Systems and Computing, vol. 1020. Springer, 2020, pp. 65–80. doi: 10.1007/978-3-030-26474-1_5

S. Yakovlev and O. Pichugina, “Continuous and convex extensions approaches in combinatorial optimization,” in Studies in Computational Intelligence, vol. 1107. Springer, 2023, pp. 257–270.

S. Yakovlev, O. Pichugina, and L. Koliechkina, Combinatorial Point Configurations and Polytopes. Wydawnictwo Uniwersytetu Łódzkiego, Lodz, 2023. doi: 10.18778/8331-391-7

R. T. Rockafellar, Convex Analysis. Princeton University Press, 1970. doi: 10.1515/9781400873173

G. M. Ziegler, Lectures on Polytopes, 7th ed. Springer, 2011. doi: 10.1007/978-1-4613-8431-1

M. Henk, J. Richter-Gebert, and G. M. Ziegler, “Basic properties of convex polytopes,” in Handbook of Discrete and Computational Geometry. CRC Press, 1997, pp. 243–270.

M. L. Balinski and A. J. Hoffman, Eds, Polyhedral Combinatorics: Dedicated to the Memory of D. R. Fulkerson. Elsevier, 1978.

B. Grunbaum, Configurations of Points and Lines. American Mathematical Society, 2009. doi: 10.1090/gsm/103

O. Pichugina and A. Brus, Computer Study of Combinatorial Sets and Polytopes. LAP Lambert Academic Publishing, 2014.

O. Pichugina and S. Yakovlev, “Continuous approaches to the unconstrained binary quadratic problems,” in Mathematical and Computational Approaches in Advancing Modern Science and Engineering. Springer, 2016, pp. 689–700. doi: 10.1007/978-3-319-30379-6_62

O. Pichugina and S. Yakovlev, “Convex extensions and continuous functional representations in optimization, with their applications,” J. Coupled Systems and Multiscale Dynamics, vol. 4, no. 2, pp. 129–152, 2016. doi: 10.1166/jcsmd.2016.1103

O. S. Pichugina and S. V. Yakovlev, “Continuous representations and functional extensions in combinatorial optimization,” Cybern. Syst. Anal., vol. 52, no. 6, pp. 921–930, 2016. doi: 10.1007/s10559-016-9894-2

O. S. Pichugina and S. V. Yakovlev, “Functional and analytic representations of the general permutations,” Eastern-European J. Enterprise Technologies, vol. 1, no. 4, pp. 27–38, 2016. doi: 10.15587/1729-4061.2016.58550

O. Pichugina and S. Yakovlev, “Quadratic optimization models and convex extensions on permutation matrix set,” in Advances in Intelligent Systems and Computing, vol. 1080. Springer, 2020, pp. 231–246. doi: 10.1007/978-3-030-33695-0_17

O. Pichugina and S. Yakovlev, “Continuous extensions on Euclidean combinatorial configurations,” Bul. Acad. Stiinte Repub. Mold. Mat., vol. 98, no. 1, pp. 3–21, 2022.

O. Pichugina and S. Yakovlev, “New classes of unconstrained permutation-based problems and their solutions,” in 2022 IEEE 3rd Int. Conf. System Analysis and Intelligent Computing (SAIC), 2022, pp. 1–5. doi: 10.1109/SAIC57818.2022.9923005

Y. G. Stoyan, S. V. Yakovlev, and O. V. Parshin, “Quadratic optimization on combinatorial sets in Rn,” Cybern. Syst. Anal., vol. 27, no. 4, pp. 561–567, 1991. doi: 10.1007/BF01130367

S. V. Yakovlev and O. A. Valuiskaya, “Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints,” Ukr. Math. J., vol. 53, no. 9, pp. 1535–1545, 2001. doi: 10.1023/A:1014374926840

L. Koliechkina and O. Pichugina, “A horizontal method of localizing values of a linear function in permutation-based optimization,” in Advances in Intelligent Systems and Computing, vol. 991. Springer, 2020, pp. 355–364. doi: 10.1007/978-3-030-25264-9_32

S. Yakovlev, O. Pichugina, and L. Koliechkina, “A lower bound for optimization of arbitrary function on permutations,” in Advances in Intelligent Systems and Computing, vol. 1246. Springer, 2021, pp. 195–212. doi: 10.1007/978-3-030-54215-3_13

Y. G. Stoyan, S. V. Yakovlev, O. A. Emets, and O. A. Valuiskaya, “Construction of convex continuations for functions defined on a hypersphere,” Cybern. Syst. Anal., vol. 34, no. 2, pp. 27–36, 1998. doi: 10.1007/BF02742066

Pobrania

Dane do pobrania nie są jeszcze dostępne.