The generalized test collection problem
From MaRDI portal
Publication:1979174
Recommendations
- The stochastic test collection problem: models, exact and heuristic solution approaches
- On the approximability of the minimum test collection problem (extended abstract)
- Parameterized study of the test cover problem
- Optimal attribute sets for identifications and diagnoses
- Branch-and-bound algorithms for the test cover problem
Cites work
- A comparative study of redundant constraints identification methods in linear programming problems
- Approximation algorithms for the test cover problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Integer programming models for feature selection: new extensions and a randomized solution algorithm
- On the approximability of the minimum test collection problem (extended abstract)
- Redundancy in mathematical programming. A state-of-the-art survey
- Sensor placement for fault location identification in water networks: a minimum test cover approach
Cited in
(2)
This page was built for publication: The generalized test collection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979174)