Pages that link to "Item:Q1797554"
From MaRDI portal
The following pages link to The complexity of approximation reoptimization algorithms for discrete optimization (Q1797554):
Displaying 6 items.
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
- Improving the complexities of approximation algorithms for optimization problems (Q1904613) (← links)
- General approach to estimating the complexity of postoptimality analysis for discrete optimization problems (Q1957000) (← links)
- Approximation to the reoptimization optimal sublinear algorithms of bounded-degree problems of a general feasibility (Q2850154) (← links)
- On the Hardness of Reoptimization with Multiple Given Solutions (Q3100925) (← links)
- (Q3161327) (← links)