Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | https://doi.org/10.1007/s10479-016-2345-7 | Annals OR |
Keywords | Field | DocType |
Combinatorial Optimization,Heuristics,Sequential testing,Function evaluation,Batch testing | Mathematical optimization,Heuristic,Set partitioning problem,Fixed cost,Algorithm,Combinatorial optimization,Heuristics,Expected cost,Sequential analysis,Mathematics | Journal |
Volume | Issue | ISSN |
253 | 1 | 0254-5330 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rebi Daldal | 1 | 0 | 0.34 |
| Ozgur Ozluk | 2 | 56 | 8.92 |
| B. Selçuk | 3 | 9 | 1.61 |
| Zahed Shahmoradi | 4 | 0 | 0.34 |
| Tonguç Ünlüyurt | 5 | 102 | 8.94 |