Pages that link to "Item:Q466348"
From MaRDI portal
The following pages link to On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems (Q466348):
Displaying 4 items.
- An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems (Q464980) (← links)
- On the complexity of postoptimality analysis of \(0/1\) programs (Q1283802) (← links)
- General approach to estimating the complexity of postoptimality analysis for discrete optimization problems (Q1957000) (← links)
- An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems (Q2263220) (← links)