Troubleshooting: NP-hardness and solution methods
From MaRDI portal
Publication:1762607
DOI10.1007/S00500-002-0224-4zbMath1088.68804OpenAlexW2035672863MaRDI QIDQ1762607
Publication date: 11 February 2005
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-002-0224-4
Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Decision-theoretic troubleshooting: hardness of approximation ⋮ Scheduling results applicable to decision-theoretic troubleshooting ⋮ Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints ⋮ Unnamed Item
This page was built for publication: Troubleshooting: NP-hardness and solution methods
