A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems
From MaRDI portal
Publication:5080670
DOI10.1287/opre.2019.1967zbMath1493.90216OpenAlexW3136110255MaRDI QIDQ5080670
Publication date: 31 May 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1967
Cites Work
- Evaluation of monotone DNF formulas
- Optimal ordering of independent tests with precedence constraints
- Heuristic least-cost computation of discrete classification functions with uncertain argument values
- Controlling backward inference
- Optimal problem-solving search: All-or-none solutions
- An optimal sequence in multicharacteristic inspection
- A new fully polynomial time approximation scheme for the Knapsack problem
- Sequential testing of complex systems: a review
- Sequential testing in batches
- Finding optimal satisficing strategies for and-or trees
- Optimal task sequencing with precedence constraints
- Learning with attribute costs
- Optimal Testing Procedures for Special Structures of Coherent Systems
- Approximation algorithms for sequential batch‐testing of series systems
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Some Reliability Fault-Testing Models
This page was built for publication: A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems
