The following pages link to Victor A. Mikhailyuk (Q334237):
Displaying 14 items.
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- (Q464900) (redirect page) (← links)
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
- An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems (Q464980) (← links)
- Sensitivity analysis of the knapsack problem: a negative result (Q465932) (← links)
- On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems (Q466348) (← links)
- Reoptimization of max \(k\)-cover: approximation ratio threshold (Q466363) (← links)
- On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (Q466374) (← links)
- On the complexity of calculating sensitivity parameters in Boolean programming problems (Q904419) (← links)
- The complexity of approximation reoptimization algorithms for discrete optimization (Q1797554) (← links)
- General approach to estimating the complexity of postoptimality analysis for discrete optimization problems (Q1957000) (← links)
- Reoptimization of set covering problems (Q2247803) (← links)
- An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems (Q2263220) (← links)
