Vladimir A. Emelichev

According to our database1, Vladimir A. Emelichev authored at least 22 papers between 1998 and 2018.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Strong stability measures for multicriteria quadratic integer programming problem of finding extremum solutions.
Comput. Sci. J. Moldova, 2018

2017
Stability Analysis of Efficient Portfolios in a Discrete Variant of Multicriteria Investment Problem with Savage's Risk Criteria.
Comput. Sci. J. Moldova, 2017

2010
Quantitative stability analysis for vector problems of 0-1 programming.
Discret. Optim., 2010

2009
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria.
Comput. Sci. J. Moldova, 2009

2008
On stability of a Pareto-optimal solution under perturbations of the parameters for a multicriteria combinatorial partition problem.
Comput. Sci. J. Moldova, 2008

2006
On quasi-stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero.
Comput. Sci. J. Moldova, 2006

2005
Measure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l<sub>1</sub> and l<sub>∞</sub> metrics.
Comput. Sci. J. Moldova, 2005

On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles.
Comput. Sci. J. Moldova, 2005

2004
On quasistability of a vector combinatorial problem with Σ-MINMAX and Σ-MINMIN partial criteria.
Comput. Sci. J. Moldova, 2004

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, 2004

2003
Quasi-stability of a vector trajectorial problem with non-linear partial criteria.
Comput. Sci. J. Moldova, 2003

Stability of generally efficient situation in finite cooperative games with parametric optimality principle ("from Pareto to Nash").
Comput. Sci. J. Moldova, 2003

On stability of Nash equilibrium situations and Pareto optimal situations in finite games.
Comput. Sci. J. Moldova, 2003

2002
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem.
Comput. Sci. J. Moldova, 2002

2001
On strong quasistability of a vector problem on substitutions.
Comput. Sci. J. Moldova, 2001

A sensitivity measure of the Pareto set in a vector l<sub>infnity</sub>-extreme combinatorial problem.
Comput. Sci. J. Moldova, 2001

2000
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, 2000

On scalarization of vector discrete problems of majority choice.
Comput. Sci. J. Moldova, 2000

1999
Stability of a majority efficient solution of a vector linear trajectorial problem.
Comput. Sci. J. Moldova, 1999

Numerical measure of strong stability and strong quasistability in the vector problem of integer linear programming.
Comput. Sci. J. Moldova, 1999

1998
Strong stability and strong quasistability of vector trajectorial problem of lexicographic optimization.
Comput. Sci. J. Moldova, 1998

Stability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem.
Comput. Sci. J. Moldova, 1998


  Loading...