default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrey I. Kibzun
Person information
- affiliation: Moscow Aviation Institute, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j27]A. N. Tarasov, Valentin M. Azanov, Andrey I. Kibzun:
Optimal Retention of the Trajectories of a Discrete-Time Stochastic System in a Tube: One Problem Statement. Autom. Remote. Control. 84(1): 42-55 (2023)- [j26]Andrey I. Kibzun, V. A. Rasskazova:
Linear Integer Programming Model as Mathematical Ware for an Optimal Flow Production Planning System at Operational Scheduling Stage. Autom. Remote. Control. 84(5): 529-542 (2023) - [j25]Sergey V. Ivanov
, Andrey I. Kibzun, V. N. Akmaeva:
Parametric Algorithm for Finding a Guaranteed Solution to a Quantile Optimization Problem. Autom. Remote. Control. 84(8): 848-857 (2023) - 2020
- [j24]Andrey I. Kibzun, Sergey V. Ivanov, A. S. Stepanova:
Construction of Confidence Absorbing Set for Analysis of Static Stochastic Systems. Autom. Remote. Control. 81(4): 589-601 (2020) - [j23]Andrey I. Kibzun, Sergey V. Ivanov:
Construction of Confidence Absorbing Sets Using Statistical Methods. Autom. Remote. Control. 81(12): 2206-2219 (2020) - 2019
- [j22]Sergey V. Ivanov, Andrey I. Kibzun, Nenad Mladenovic:
Variable Neighborhood Search for a Two-Stage Stochastic Programming Problem with a Quantile Criterion. Autom. Remote. Control. 80(1): 43-52 (2019) - [j21]Sergey V. Ivanov, Andrey I. Kibzun:
General Properties of Two-Stage Stochastic Programming Problems with Probabilistic Criteria. Autom. Remote. Control. 80(6): 1041-1057 (2019) - [j20]Sergey V. Ivanov, Andrey I. Kibzun, Nenad Mladenovic, Dragan Urosevic:
Variable neighborhood search for stochastic linear programming problem with quantile criterion. J. Glob. Optim. 74(3): 549-564 (2019) - 2018
- [j19]Andrey V. Borisov, Alexey V. Bosov, Andrey I. Kibzun, Gregory B. Miller, Konstantin V. Semenikhin:
The Conditionally Minimax Nonlinear Filtering Method and Modern Approaches to State Estimation in Nonlinear Stochastic Systems. Autom. Remote. Control. 79(1): 1-11 (2018) - [j18]Sergey V. Ivanov, Andrey I. Kibzun:
On the Convergence of Sample Approximations for Stochastic Programming Problems with Probabilistic Criteria. Autom. Remote. Control. 79(2): 216-228 (2018) - [j17]Andrey I. Kibzun, A. N. Tarasov:
Stochastic Model of the Electric Power Purchase System on a Railway Segment. Autom. Remote. Control. 79(3): 425-438 (2018) - [j16]Damir N. Gainanov, Andrey I. Kibzun, V. A. Rasskazova:
The Decomposition Problem for the Set of Paths in a Directed Graph and Its Application. Autom. Remote. Control. 79(12): 2217-2236 (2018) - 2017
- [j15]Andrey I. Kibzun, Alexei N. Ignatov:
On the existence of optimal strategies in the control problem for a stochastic discrete time system with respect to the probability criterion. Autom. Remote. Control. 78(10): 1845-1856 (2017) - [j14]Andrey I. Kibzun, E. A. Zharkov:
Two algorithms for estimating test complexity levels. Autom. Remote. Control. 78(12): 2165-2177 (2017) - 2016
- [j13]Alexei N. Ignatov, Andrey I. Kibzun, Evgeni N. Platonov:
Estimating collision probabilities for trains on railroad stations based on a Poisson model. Autom. Remote. Control. 77(11): 1914-1927 (2016) - [j12]Sergey V. Ivanov, Andrey I. Kibzun, A. V. Osokin:
Stochastic optimization model of locomotive assignment to freight trains. Autom. Remote. Control. 77(11): 1944-1956 (2016) - [j11]Andrey I. Kibzun, Alexei N. Ignatov:
Reduction of the two-step problem of stochastic optimal control with bilinear model to the problem of mixed integer linear programming. Autom. Remote. Control. 77(12): 2175-2192 (2016) - 2015
- [j10]Andrey I. Kibzun, Alexei N. Ignatov:
The two-step problem of investment portfolio selection from two risk assets via the probability criterion. Autom. Remote. Control. 76(7): 1201-1220 (2015) - [j9]Andrey I. Kibzun, V. R. Sobol':
The modified sequential hedging strategy: Hedger's loss distribution. Autom. Remote. Control. 76(11): 1931-1944 (2015) - 2014
- [j8]Alexei N. Ignatov, Andrey I. Kibzun:
On formation of security portfolio with uniform distribution by logarithmic criterion and priority risk component. Autom. Remote. Control. 75(3): 481-495 (2014) - [j7]Andrey I. Kibzun, A. O. Inozemtsev:
Using the maximum likelihood method to estimate test complexity levels. Autom. Remote. Control. 75(4): 607-621 (2014) - [j6]Andrey I. Kibzun, Olga M. Khromova:
On reduction of the multistage problem of stochastic programming with quantile criterion to the problem of mixed integer linear programming. Autom. Remote. Control. 75(4): 688-699 (2014) - [j5]Andrey I. Kibzun, Olga M. Khromova:
On reduction of the two-stage problem of quantile optimization to the problem of convex programming. Autom. Remote. Control. 75(5): 859-871 (2014) - 2013
- [j4]Andrey I. Kibzun, A. I. Chernobrovov:
Equivalence of the problems with quantile and integral quantile criteria. Autom. Remote. Control. 74(2): 225-239 (2013) - [j3]Andrey I. Kibzun, Andrey V. Naumov, Vladimir I. Norkin:
On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem. Autom. Remote. Control. 74(6): 951-967 (2013) - 2012
- [j2]Andrey I. Kibzun, Evgeniy Matveev:
Optimization of the quantile criterion for the convex loss function by a stochastic quasigradient algorithm. Ann. Oper. Res. 200(1): 183-198 (2012) - 1991
- [j1]Andrey I. Kibzun, V. Yu. Kurbakovskiy:
Guaranteeing approach to solving quantile optimization problems. Ann. Oper. Res. 30(1): 81-93 (1991)
Conference and Workshop Papers
- 2016
- [c1]Andrey I. Kibzun, Sergey V. Ivanov:
Convergence of Discrete Approximations of Stochastic Programming Problems with Probabilistic Criteria. DOOR 2016: 525-537
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-07 22:19 CEST 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:
