Login / Signup
Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard.
Jiri Rohn
Vladik Kreinovich
Published in:
SIAM J. Matrix Anal. Appl. (1995)
Keyphrases
</>
interval data
np hard
optimal solution
lower bound
minmax regret
scheduling problem
upper bound
exact solution
data sets
special case
multi objective
worst case
knapsack problem
lower and upper bounds
shortest path problem