A polynomial-time approximation scheme for sequential batch testing of series systems
From MaRDI portal
Publication:5080670
Recommendations
Cites work
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- An optimal sequence in multicharacteristic inspection
- Approximation algorithms for sequential batch-testing of series systems
- Approximation algorithms for stochastic Boolean function evaluation and stochastic submodular set cover
- Controlling backward inference
- Evaluation of monotone DNF formulas
- Finding optimal satisficing strategies for and-or trees
- Heuristic least-cost computation of discrete classification functions with uncertain argument values
- Learning with attribute costs
- Optimal Testing Procedures for Special Structures of Coherent Systems
- Optimal ordering of independent tests with precedence constraints
- Optimal problem-solving search: All-or-none solutions
- Optimal task sequencing with precedence constraints
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- Sequential testing in batches
- Sequential testing of complex systems: a review
- Some Reliability Fault-Testing Models
Cited in
(3)
This page was built for publication: A polynomial-time approximation scheme for sequential batch testing of series systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080670)