.png){kind=icon}
.png){kind=icon}
Return
Sequential testing in batches
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-016-2345-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study a new extension of the Sequential Testing problem with a modified cost structure that allows performing of some tests in batches. As in the Sequential Testing problem, we assume a certain dependence between the test results and the conclusion. Namely, we stop testing once a positive result is obtained or all tests are negative. Our extension, motivated by health care applications, considers a fixed cost associated with executing a batch of tests, with the general notion that the more tests are performed in batches, the smaller the total contribution of fixed costs to the sequential testing process. The goal is to minimize the expected cost of testing by finding the optimal choice and sequence of the batches available. The resulting NP-hard model is a variation of the set partitioning problem. We propose various heuristic algorithms for the effective solution of the problem and then demonstrate the performances of the algorithms through extensive numerical experiments.
Keywords:
Combinatorial Optimization
Heuristics
Sequential testing
Function evaluation
Batch testing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
View more organizations