default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetro I. Stetsyuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Andreas Fischer, Igor S. Litvinchev, Tetyana Romanova, Petro Stetsyuk, Georgiy Yaskov:
Packing spheres with quasi-containment conditions. J. Glob. Optim. 90(3): 671-689 (2024)- [c4]Petro Stetsyuk, Viktor Stovba, Ivan Senko, Illya Chaikovsky:
Using of Ellipsoid Method and Linear Regression with L1-Regularization for Medical Data Investigation. ProfIT AI 2024: 210-221 - 2023
- [j4]Dmytro Vakulenko
, Lyudmyla Vakulenko, Hryhoriy Zaspa, Serhii Lupenko, Petro Stetsyuk, Viktor Stovba:
Components of Oranta-AO software expert system for innovative application of blood pressure monitors. J. Reliab. Intell. Environ. 9(1): 41-56 (2023) - [c3]Petro Stetsyuk, Viktor Stovba, Oleksandr Zhmud:
Storage Location Problem: Properties and Computational Aspects. IntSol 2023: 148-157 - 2022
- [j3]Tetyana Romanova, Olexandr Pankratov, Igor S. Litvinchev, Petro Stetsyuk, Oleksii Lykhovyd, Jose Antonio Marmolejo Saucedo, Pandian Vasant:
Balanced Circular Packing Problems with Distance Constraints. Comput. 10(7): 113 (2022) - 2021
- [c2]Petro Stetsyuk, Andreas Fischer, Oksana Pichugina:
A Penalty Approach to Linear Programs with Many Two-Sided Constraints. MOTOR 2021: 206-217
2010 – 2019
- 2016
- [j2]Petro I. Stetsyuk, Tatiana E. Romanova, Guntram Scheithauer:
On the global minimum in a balanced circular packing problem. Optim. Lett. 10(6): 1347-1360 (2016) - 2014
- [p1]Yuriy Stoyan, Petro Stetsyuk, Tatiana E. Romanova:
Optimal Balanced Packing Using Phi-Function Technique. Examining Robustness and Vulnerability of Networked Systems 2014: 251-271
2000 – 2009
- 2002
- [j1]Naum Z. Shor, Petro I. Stetsyuk:
Lagrangian bounds in multiextremal polynomial and discrete optimization problems. J. Glob. Optim. 23(1): 1-41 (2002) - [c1]Sergiy Butenko, Panos M. Pardalos, Ivan Sergienko, Vladimir Shylo, Petro Stetsyuk:
Finding maximum independent sets in graphs arising from coding theory. SAC 2002: 542-546
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
