Finding maximum independent sets in graphs arising from coding theory. - Sergiy Butenko; Panos M. Pardalos; Ivan Sergienko; Vladimir Shylo; Petro Stetsyuk (SAC, 2002)

Lagrangian bounds in multiextremal polynomial and discrete optimization problems. - Naum Z. Shor; Petro I. Stetsyuk (J. Glob. Optim., 2002)

Optimal Balanced Packing Using Phi-Function Technique. - Yuriy Stoyan; Petro Stetsyuk; Tatiana E. Romanova (Examining Robustness and Vulnerability of Networked Systems, 2014)

On the global minimum in a balanced circular packing problem. - Petro I. Stetsyuk; Tatiana E. Romanova; Guntram Scheithauer (Optim. Lett., 2016)

A Penalty Approach to Linear Programs with Many Two-Sided Constraints. - Petro Stetsyuk; Andreas Fischer 004; Oksana Pichugina (MOTOR, 2021)

Balanced Circular Packing Problems with Distance Constraints. - Tetyana Romanova; Olexandr Pankratov; Igor S. Litvinchev; Petro Stetsyuk; Oleksii Lykhovyd; Jose Antonio Marmolejo Saucedo; Pandian Vasant (Comput., 2022)

Storage Location Problem: Properties and Computational Aspects. - Petro Stetsyuk; Viktor Stovba; Oleksandr Zhmud (IntSol, 2023)

Components of Oranta-AO software expert system for innovative application of blood pressure monitors. - Dmytro Vakulenko; Lyudmyla Vakulenko; Hryhoriy Zaspa; Serhii Lupenko; Petro Stetsyuk; Viktor Stovba (J. Reliab. Intell. Environ., 2023)

Using of Ellipsoid Method and Linear Regression with L1-Regularization for Medical Data Investigation. - Petro Stetsyuk; Viktor Stovba; Ivan Senko; Illya Chaikovsky (ProfIT AI, 2024)

Packing spheres with quasi-containment conditions. - Andreas Fischer 004; Igor S. Litvinchev; Tetyana Romanova; Petro Stetsyuk; Georgiy Yaskov (J. Glob. Optim., 2024)