Victor A. Mikhailyuk

Available identifiers

zbMath Open mikhailyuk.victor-aMaRDI QIDQ334237

List of research outcomes

Publication	Date of Publication	Type
The complexity of approximation reoptimization algorithms for discrete optimization	2018-10-22	Paper
Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions	2016-11-01	Paper
On the complexity of calculating sensitivity parameters in Boolean programming problems	2016-01-13	Paper
An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems	2015-03-18	Paper
On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems	2014-10-30	Paper
An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems	2014-10-30	Paper
Reoptimization of max \(k\)-cover: approximation ratio threshold	2014-10-27	Paper
On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems	2014-10-27	Paper
On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field	2014-10-27	Paper
Sensitivity analysis of the knapsack problem: a negative result	2014-10-24	Paper
Reoptimization of set covering problems	2014-06-30	Paper
Reoptimization of constraint satisfaction problems with approximation resistant predicates	2013-11-14	Paper
General approach to estimating the complexity of postoptimality analysis for discrete optimization problems	2010-09-24	Paper

Research outcomes over time

This page was built for person: Victor A. Mikhailyuk