default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYury Nikulin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Mojtaba Nayyeri, Modjtaba Rouhani
, Hadi Sadoghi Yazdi, Marko M. Mäkelä, Alaleh Maskooki, Yury Nikulin:
Correntropy-Based Constructive One Hidden Layer Neural Network. Algorithms 17(1): 49 (2024)- 2020
- [j16]Vladimir A. Emelichev, Yury Nikulin:
On one type of stability for multiobjective integer linear programming problem with parameterized optimality. Comput. Sci. J. Moldova 28(3): 249-268 (2020) - 2018
- [j15]Vladimir A. Emelichev, Yury Nikulin:
Strong stability measures for multicriteria quadratic integer programming problem of finding extremum solutions. Comput. Sci. J. Moldova 26(2): 115-125 (2018) - 2017
- [j14]Vladimir A. Emelichev, Yury Nikulin, Vladimir Korotkov:
Stability Analysis of Efficient Portfolios in a Discrete Variant of Multicriteria Investment Problem with Savage's Risk Criteria. Comput. Sci. J. Moldova 25(3): 303-328 (2017) - 2013
- [j13]Yury Nikulin, O. Karelkina, Marko M. Mäkelä:
On accuracy, robustness and tolerances in vector Boolean optimization. Eur. J. Oper. Res. 224(3): 449-457 (2013) - 2012
- [j12]Yury Nikulin, Zuhair Iftikhar:
A note on different modelling approaches for the robust shortest path problem. Int. J. Math. Model. Numer. Optimisation 3(3): 141-157 (2012) - [j11]Yury Nikulin, Kaisa Miettinen, Marko M. Mäkelä:
A new achievement scalarizing function based on parameterization in multiobjective optimization. OR Spectr. 34(1): 69-87 (2012) - 2010
- [j10]Yury Nikulin, Marko M. Mäkelä:
Stability and accuracy functions for a multicriteria Boolean linear programming problem with parameterized principle of optimality "from Condorcet to Pareto". Eur. J. Oper. Res. 207(3): 1497-1505 (2010) - [j9]Jørgen Bang-Jensen, Yury Nikulin:
Heuristics for the central tree problem. J. Heuristics 16(5): 633-651 (2010) - [j8]Yury Nikulin, Andreas Drexl:
Theoretical aspects of multicriteria flight gate scheduling: deterministic and fuzzy models. J. Sched. 13(3): 261-280 (2010) - 2009
- [j7]Yury Nikulin:
Stability and accuracy functions in a coalition game with bans, linear payoffs and antagonistic strategies. Ann. Oper. Res. 172(1): 25-35 (2009) - 2008
- [j6]Yury Nikulin:
Simulated annealing algorithm for the robust spanning tree problem. J. Heuristics 14(4): 391-402 (2008) - [j5]Marko M. Mäkelä, Yury Nikulin:
Properties of efficient solution sets under addition of objectives. Oper. Res. Lett. 36(6): 718-721 (2008) - 2006
- [j4]Marek Libura, Yury Nikulin:
Stability and accuracy functions in multicriteria linear combinatorial optimization problems. Ann. Oper. Res. 147(1): 255-267 (2006) - 2002
- [j3]Vladimir A. Emelichev, Vitaly N. Krichko, Yury Nikulin:
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem. Comput. Sci. J. Moldova 10(2): 136-142 (2002) - [j2]Vladimir A. Emelichev, Vitaly N. Krichko, Yury Nikulin:
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem. Comput. Sci. J. Moldova 10(3): 320-328 (2002) - 1999
- [j1]Vladimir A. Emelichev, Yury Nikulin:
Numerical measure of strong stability and strong quasistability in the vector problem of integer linear programming. Comput. Sci. J. Moldova 7(1): 105-117 (1999)
Conference and Workshop Papers
- 2024
- [c2]Muhamad Rausyan Fikri, Made Widhi Surya Atman, Yury Nikulin, Azwirman Gusrialdi:
Efficient Multi-Robot Task Allocation with Nonsmooth Objective Functions for Persistent Monitoring in Large Dispersed Areas. CASE 2024: 573-578 - 2021
- [c1]Yury Nikulin, Vladimir A. Emelichev:
Analyzing Stability of Extreme Portfolios. OPTIMA 2021: 303-317
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 2025-01-09 13:20 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:
