A bright side of NP-hardness of interval computations: interval heuristics applied to NP-problems

Bonnie Traylor, Vladik Kreinovich. A bright side of NP-hardness of interval computations: interval heuristics applied to NP-problems. Reliable Computing, 1(3):343-359, 1995. [doi]

@article{TraylorK95,
  title = {A bright side of NP-hardness of interval computations: interval heuristics applied to NP-problems},
  author = {Bonnie Traylor and Vladik Kreinovich},
  year = {1995},
  doi = {10.1007/BF02385263},
  url = {http://dx.doi.org/10.1007/BF02385263},
  researchr = {https://researchr.org/publication/TraylorK95},
  cites = {0},
  citedby = {0},
  journal = {Reliable Computing},
  volume = {1},
  number = {3},
  pages = {343-359},
}