Pages that link to "Item:Q1957000"
From MaRDI portal
The following pages link to General approach to estimating the complexity of postoptimality analysis for discrete optimization problems (Q1957000):
Displaying 7 items.
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← 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)
- 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)
- An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems (Q2263220) (← links)
