V. A. Mikhailyuk

发表

Reoptimization of set covering problems

V. A. Mikhailyuk, 2010 .

Optimal Approximation Algorithms for Reoptimization of Constraint Satisfaction Problems

V. A. Mikhailyuk, 2013 .

Reoptimization of constraint satisfaction problems with approximation resistant predicates

I. Sergienko, V. A. Mikhailyuk, 2012 .

Reoptimization of max k-cover: approximation ratio threshold

V. A. Mikhailyuk, 2012 .

On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems

V. A. Mikhailyuk, 2011 .

On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems

V. A. Mikhailyuk, 2010 .

An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems

V. A. Mikhailyuk, 2012 .

An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems

V. A. Mikhailyuk, 2011 .

On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field

V. A. Mikhailyuk, 2012, Cybernetics and Systems Analysis.

On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field

V. A. Mikhailyuk, 2012 .

Reoptimization of constraint satisfaction problems with approximation resistant predicates

I. Sergienko, V. A. Mikhailyuk, 2012, Cybernetics and Systems Analysis.

General approach to estimating the complexity of postoptimality analysis for discrete optimization problems

V. A. Mikhailyuk, 2010 .

Solving Knapsack Problem: Postoptimality Analysis and Branch and Bound Method

Victor A. Mikhailyuk, V. A. Mikhailyuk, 2011 .