default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir A. Emelichev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j24]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
- [j23]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
- [j22]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) - 2010
- [j21]Vladimir A. Emelichev, Dmitry Podkopaev
:
Quantitative stability analysis for vector problems of 0-1 programming. Discret. Optim. 7(1-2): 48-63 (2010) - 2009
- [j20]Vladimir A. Emelichev, Olga V. Karelkina:
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria. Comput. Sci. J. Moldova 17(1): 48-57 (2009) - 2008
- [j19]Vladimir A. Emelichev, Evgeny E. Gurevsky:
On stability of a Pareto-optimal solution under perturbations of the parameters for a multicriteria combinatorial partition problem. Comput. Sci. J. Moldova 16(2): 286-297 (2008) - 2006
- [j18]Vladimir A. Emelichev, Evgeny E. Gurevsky:
On quasi-stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero. Comput. Sci. J. Moldova 14(2): 207-218 (2006) - 2005
- [j17]Sergey E. Bukhtoyarov, Vladimir A. Emelichev:
On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles. Comput. Sci. J. Moldova 13(1): 47-58 (2005) - [j16]Vladimir A. Emelichev, Olga V. Karelkina, Kirill G. Kuzmin:
Measure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l1 and l∞ metrics. Comput. Sci. J. Moldova 13(2): 177-192 (2005) - 2004
- [j15]Vladimir A. Emelichev, Kirill G. Kuzmin, Andrey M. Leonovich:
On quasistability of a vector combinatorial problem with Σ-MINMAX and Σ-MINMIN partial criteria. Comput. Sci. J. Moldova 12(1): 3-24 (2004) - [j14]Sergey E. Bukhtoyarov, Vladimir A. Emelichev:
On stability of an optimal situation in a finite cooperative game with a parametric concept of equilibrium (from lexicographic optimality to Nash equilibrium). Comput. Sci. J. Moldova 12(3): 371-380 (2004) - 2003
- [j13]Vladimir A. Emelichev, Sergey E. Bukhtoyarov:
On stability of Nash equilibrium situations and Pareto optimal situations in finite games. Comput. Sci. J. Moldova 11(1): 28-34 (2003) - [j12]Vladimir A. Emelichev, Kirill E. Kovalenko:
Quasi-stability of a vector trajectorial problem with non-linear partial criteria. Comput. Sci. J. Moldova 11(2): 137-149 (2003) - [j11]Vladimir A. Emelichev, Sergey E. Bukhtoyarov:
Stability of generally efficient situation in finite cooperative games with parametric optimality principle ("from Pareto to Nash"). Comput. Sci. J. Moldova 11(3): 316-323 (2003) - 2002
- [j10]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) - [j9]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) - 2001
- [j8]Vladimir A. Emelichev, V. G. Pakhilka:
On strong quasistability of a vector problem on substitutions. Comput. Sci. J. Moldova 9(1): 71-85 (2001) - [j7]Vladimir A. Emelichev, Andrey M. Leonovich:
A sensitivity measure of the Pareto set in a vector linfnity-extreme combinatorial problem. Comput. Sci. J. Moldova 9(3): 291-304 (2001) - 2000
- [j6]Vladimir A. Emelichev, A. V. Pashkevich:
On scalarization of vector discrete problems of majority choice. Comput. Sci. J. Moldova 8(2): 190-208 (2000) - [j5]Vladimir A. Emelichev, A. V. Pashkevich:
Vector discrete problems: parametrization of an optimality principle and conditions of solvability in the class of algorithms involving linear convolution of criteria. Comput. Sci. J. Moldova 8(3): 260-269 (2000) - 1999
- [j4]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) - [j3]Vladimir A. Emelichev, Yu. V. Stepanishyna:
Stability of a majority efficient solution of a vector linear trajectorial problem. Comput. Sci. J. Moldova 7(3): 291-307 (1999) - 1998
- [j2]R. A. Berdysheva, Vladimir A. Emelichev, Eberhard Girlich:
Stability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem. Comput. Sci. J. Moldova 6(1): 35-56 (1998) - [j1]Vladimir A. Emelichev, R. A. Berdysheva:
Strong stability and strong quasistability of vector trajectorial problem of lexicographic optimization. Comput. Sci. J. Moldova 6(2): 119-136 (1998)
Conference and Workshop Papers
- 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 2024-04-24 23:15 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:
