Beyond interval systems: What is feasible and what is algorithmically solvable?

Authors
Kreinovich, V
Citation
V. Kreinovich, Beyond interval systems: What is feasible and what is algorithmically solvable?, NONC OPTIM, 42, 2000, pp. 364-379
Categorie Soggetti
Current Book Contents","Current Book Contents
Journal title
APPROXIMATION AND COMPLEXITY IN NUMERICAL OPTIMIZATION : CONTINUOUS AND DISCRETE PROBLEMS → ACNP
Volume
42
Year of publication
2000
Pages
364 - 379
Database
ISI
SICI code