default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPavlo A. Krokhmal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Eugene Lykhovyd, Sergiy Butenko
, Pavlo A. Krokhmal:
Asymptotic bounds for clustering problems in random graphs. Networks 83(3): 485-502 (2024)- 2023
- [j31]Ya-Feng Liu, Zi Xu, Pavlo A. Krokhmal, Jiming Peng:
Preface: special issue of MOA 2020. J. Glob. Optim. 87(2): 325-327 (2023) - [j30]Masoud Eshghali, Pavlo A. Krokhmal:
Risk-averse optimization and resilient network flows. Networks 82(2): 129-152 (2023) - 2021
- [j29]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2019. Optim. Lett. 15(1): 1-2 (2021) - [j28]Juan Sebastian Borrero, Majid Akhgar, Pavlo A. Krokhmal:
A Scalable Markov Chain Framework for Influence Maximization in Arbitrary Networks. IEEE Trans. Netw. Sci. Eng. 8(3): 2372-2387 (2021) - 2020
- [j27]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2018. Optim. Lett. 14(1): 1 (2020)
2010 – 2019
- 2019
- [j26]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2017. Optim. Lett. 13(1): 1 (2019) - [j25]Juan Sebastian Borrero, Oleg A. Prokopyev, Pavlo A. Krokhmal:
Optimization of Cascading Processes in Arbitrary Networks with Stochastic Interactions. IEEE Trans. Netw. Sci. Eng. 6(4): 773-787 (2019) - 2018
- [j24]Maciej Rysz, Foad Mahdavi Pajouh, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights. Ann. Oper. Res. 262(1): 89-108 (2018) - [j23]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2016. Optim. Lett. 12(1): 1 (2018) - 2017
- [j22]Alexander Vinel, Pavlo A. Krokhmal:
Certainty equivalent measures of risk. Ann. Oper. Res. 249(1-2): 75-95 (2017) - [j21]Alexander Vinel, Pavlo A. Krokhmal:
Mixed integer programming with a class of nonlinear convex constraints. Discret. Optim. 24: 66-86 (2017) - [j20]Maciej Rysz, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach. Networks 69(2): 189-204 (2017) - [j19]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2015. Optim. Lett. 11(1): 1-2 (2017) - 2016
- [j18]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award. Optim. Lett. 10(1): 1 (2016) - 2015
- [j17]Maciej Rysz, Alexander Vinel, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures. INFORMS J. Comput. 27(2): 416-430 (2015) - 2014
- [j16]Maciej Rysz, Mohammad Mirghorbani, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
On risk-averse maximum weighted subgraph problems. J. Comb. Optim. 28(1): 167-185 (2014) - [j15]Alexander Vinel, Pavlo A. Krokhmal:
On Valid Inequalities for Mixed Integer p-Order Cone Programming. J. Optim. Theory Appl. 160(2): 439-456 (2014) - [j14]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award. Optim. Lett. 8(8): 2153-2154 (2014) - [j13]Alexander Vinel, Pavlo A. Krokhmal:
Polyhedral approximations in p-order cone programming. Optim. Methods Softw. 29(6): 1210-1237 (2014) - [p2]Maciej Rysz, Foad Mahdavi Pajouh, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
On Risk-Averse Weighted k-Club Problems. Examining Robustness and Vulnerability of Networked Systems 2014: 231-242 - 2013
- [j12]Yana Morenko, Alexander Vinel, Zhaohan Yu, Pavlo A. Krokhmal:
On p-norm linear discrimination. Eur. J. Oper. Res. 231(3): 784-789 (2013) - [j11]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Editorial. Optim. Lett. 7(1): 1-2 (2013) - [j10]Mohammad Mirghorbani, Pavlo A. Krokhmal:
On finding k-cliques in k-partite graphs. Optim. Lett. 7(6): 1155-1165 (2013) - 2012
- [j9]Jordan Cannon, Pavlo A. Krokhmal, Yong Chen, Robert Murphey:
Detection of temporal changes in psychophysiological data using statistical process control methods. Comput. Methods Programs Biomed. 107(3): 367-381 (2012) - 2011
- [j8]Pavlo A. Krokhmal:
On optimality of a polynomial algorithm for random linear multidimensional assignment problem. Optim. Lett. 5(1): 153-164 (2011) - 2010
- [j7]Jordan Cannon, Pavlo A. Krokhmal, Russell V. Lenth, Robert Murphey:
An algorithm for online detection of temporal changes in operator cognitive state using real-time psychophysiological data. Biomed. Signal Process. Control. 5(3): 229-236 (2010) - [j6]Pavlo A. Krokhmal, Policarpio Soberanis:
Risk optimization with p-order conic constraints: A linear programming approach. Eur. J. Oper. Res. 201(3): 653-671 (2010) - [j5]Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. Pardalos:
On the Hamming distance in combinatorial optimization problems on hypergraph matchings. Optim. Lett. 4(4): 609-617 (2010)
2000 – 2009
- 2009
- [j4]Pavlo A. Krokhmal, Panos M. Pardalos:
Random assignment problems. Eur. J. Oper. Res. 194(1): 1-17 (2009) - [r1]Pavlo A. Krokhmal:
Asymptotic Properties of Random Multidimensional Assignment Problem. Encyclopedia of Optimization 2009: 114-123 - 2007
- [j3]Pavlo A. Krokhmal, Stan Uryasev:
A sample-path approach to optimal position liquidation. Ann. Oper. Res. 152(1): 193-225 (2007) - [j2]Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Oliveira, Panos M. Pardalos:
On the number of local minima for the multidimensional assignment problem. J. Comb. Optim. 13(1): 1-18 (2007) - [j1]Pavlo A. Krokhmal, Don A. Grundel, Panos M. Pardalos:
Asymptotic behavior of the expected optimal value of the multidimensional assignment problem. Math. Program. 109(2-3): 525-551 (2007) - 2005
- [p1]Pavlo A. Krokhmal, Stan Uryasev, Grigoriy Zrazhevsky:
29. Numerical Comparison of Conditional Value-at-Risk and Conditional Drawdown-at-Risk Approaches: Application to Hedge Funds. Applications of Stochastic Programming 2005: 609-631
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-06-10 20:31 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:
