{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:19:32Z","timestamp":1775326772166,"version":"3.50.1"},"reference-count":91,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1016\/j.dam.2025.07.039","type":"journal-article","created":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T15:40:39Z","timestamp":1753717239000},"page":"356-369","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Sequential testing problem: A follow-up review"],"prefix":"10.1016","volume":"377","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3840-0806","authenticated-orcid":false,"given":"Tongu\u00e7","family":"\u00dcnl\u00fcyurt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2025.07.039_b1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10951-008-0076-6","article-title":"Sequencing unreliable jobs on parallel machines","volume":"12","author":"Agnetis","year":"2009","journal-title":"J. Sched."},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b2","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.ejor.2021.03.038","article-title":"Time-critical testing and search problems","volume":"296","author":"Agnetis","year":"2022","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2025.07.039_b3","series-title":"2017 E-Health and Bioengineering Conference","first-page":"65","article-title":"From logical inference to decision trees in medical diagnosis","author":"Albu","year":"2017"},{"issue":"3","key":"10.1016\/j.dam.2025.07.039_b4","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s00453-015-0092-9","article-title":"Evaluation of monotone DNF formulas","volume":"77","author":"Allen","year":"2017","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2025.07.039_b5","doi-asserted-by":"crossref","unstructured":"Y. Amsterdamer, O. Drien, PePPer: Fine-grained personal access control via peer probing, in: 2019 IEEE 35th International Conference on Data Engineering, ICDE, 2019, pp. 2012\u20132015.","DOI":"10.1109\/ICDE.2019.00227"},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b6","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.ejor.2006.03.057","article-title":"Optimal resource allocation for security in reliability systems","volume":"181","author":"Azaiez","year":"2007","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2025.07.039_b7","doi-asserted-by":"crossref","first-page":"2387","DOI":"10.1007\/s00521-012-1196-7","article-title":"Decision tree classifiers for automated medical diagnosis","volume":"23","author":"Azar","year":"2013","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.dam.2025.07.039_b8","series-title":"2008 Fourth International Conference on Natural Computation","first-page":"202","article-title":"Optimal sequential inspections of complex systems subject to block-chain precedence constraints","volume":"4","author":"Bao","year":"2008"},{"issue":"8","key":"10.1016\/j.dam.2025.07.039_b9","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1177\/10591478241255066","article-title":"Decentralized online order fulfillment in omni-channel retailers","volume":"33","author":"Baron","year":"2024","journal-title":"Prod. Oper. Manage."},{"issue":"1","key":"10.1016\/j.dam.2025.07.039_b10","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TIT.2011.2169296","article-title":"Group-based active query selection for rapid diagnosis in time-critical situations","volume":"58","author":"Bellala","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"10.1016\/j.dam.2025.07.039_b11","doi-asserted-by":"crossref","first-page":"1410","DOI":"10.1287\/mnsc.27.12.1410","article-title":"Optimal testing procedures for special structures of coherent systems","volume":"27","author":"Ben-Dov","year":"1981","journal-title":"Manag. Sci."},{"key":"10.1016\/j.dam.2025.07.039_b12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.dam.2013.07.014","article-title":"Optimal ordering of independent tests with precedence constraints","volume":"162","author":"Berend","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.07.039_b13","series-title":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","first-page":"1638","article-title":"Query strategies for priced information, revisited","author":"Blanc","year":"2021"},{"key":"10.1016\/j.dam.2025.07.039_b14","first-page":"319","article-title":"Optimization problems for port-of-entry detection systems","author":"Boros","year":"2008","journal-title":"Intell. Secur. Inform.: Tech. Appl."},{"key":"10.1016\/j.dam.2025.07.039_b15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1018958928835","article-title":"Diagnosing double regular systems","volume":"26","author":"Boros","year":"1999","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.dam.2025.07.039_b16","first-page":"39","article-title":"Sequential testing of series-parallel systems of small depth","author":"Boros","year":"2000","journal-title":"Comput. Tools Model. Optim. Simul.: Interfaces Comput. Sci. Oper. Res."},{"key":"10.1016\/j.dam.2025.07.039_b17","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1287\/opre.20.2.335","article-title":"Some reliability fault testing models","volume":"20","author":"Butterworth","year":"1972","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.dam.2025.07.039_b18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1186810.1186819","article-title":"Querying priced information in databases: The conjunctive case","volume":"3","author":"Carmo","year":"2007","journal-title":"ACM Trans. Algorithms"},{"issue":"12","key":"10.1016\/j.dam.2025.07.039_b19","doi-asserted-by":"crossref","first-page":"14945","DOI":"10.1016\/j.eswa.2011.05.053","article-title":"TestAnt: An ant colony system approach to sequential testing under precedence constraints","volume":"38","author":"\u00c7atay","year":"2011","journal-title":"Expert. Syst. Appl.: An Int. J."},{"issue":"4","key":"10.1016\/j.dam.2025.07.039_b20","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1109\/12.54850","article-title":"Optimal diagnosis procedures for k-out-of-n structures","volume":"39","author":"Chang","year":"1990","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/j.dam.2025.07.039_b21","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1006\/jcss.2002.1828","article-title":"Query strategies for priced information","volume":"64","author":"Charikar","year":"2002","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/j.dam.2025.07.039_b22","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.artmed.2010.08.001","article-title":"A decision support system for cost-effective diagnosis","volume":"50","author":"Chi","year":"2010","journal-title":"Artif. Intell. Med."},{"key":"10.1016\/j.dam.2025.07.039_b23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2016.07.009","article-title":"Totally optimal decision trees for Boolean functions","volume":"215","author":"Chikalov","year":"2016","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"10.1016\/j.dam.2025.07.039_b24","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1016\/j.dam.2010.05.016","article-title":"Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case","volume":"159","author":"Cicalese","year":"2011","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.07.039_b25","doi-asserted-by":"crossref","unstructured":"F. Cicalese, E.S. Laber, On the competitive ratio of evaluating priced functions, in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, 2006, pp. 944\u2013953, Citeseer.","DOI":"10.1145\/1109557.1109661"},{"key":"10.1016\/j.dam.2025.07.039_b26","series-title":"International Conference on Machine Learning","first-page":"414","article-title":"Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost","author":"Cicalese","year":"2014"},{"key":"10.1016\/j.dam.2025.07.039_b27","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s00453-016-0225-9","article-title":"Decision trees for function evaluation: simultaneous optimization of worst and expected cost","volume":"79","author":"Cicalese","year":"2017","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2025.07.039_b28","series-title":"Optimal Search in Discrete Locations: Extensions and New Findings","author":"Clarkson","year":"2020"},{"issue":"4","key":"10.1016\/j.dam.2025.07.039_b29","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/nav.21693","article-title":"Approximation algorithms for sequential batch-testing of series systems","volume":"63","author":"Daldal","year":"2016","journal-title":"Naval Res. Logist."},{"key":"10.1016\/j.dam.2025.07.039_b30","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10479-016-2345-7","article-title":"Sequential testing in batches","volume":"253","author":"Daldal","year":"2017","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"10.1016\/j.dam.2025.07.039_b31","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1080\/07408170701413944","article-title":"R&D project scheduling when activities may fail","volume":"40","author":"De Reyck","year":"2008","journal-title":"IIE Trans."},{"key":"10.1016\/j.dam.2025.07.039_b32","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1453","article-title":"Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover","author":"Deshpande","year":"2014"},{"issue":"3","key":"10.1016\/j.dam.2025.07.039_b33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2876506","article-title":"Approximation algorithms for stochastic submodular set cover with applications to boolean function evaluation and min-knapsack","volume":"12","author":"Deshpande","year":"2016","journal-title":"ACM Trans. Algorithms ( TALG)"},{"key":"10.1016\/j.dam.2025.07.039_b34","series-title":"2021 IEEE 37th International Conference on Data Engineering","first-page":"1949","article-title":"Managing consent for data access in shared databases","author":"Drien","year":"2021"},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3589325","article-title":"Query-guided resolution in uncertain databases","volume":"1","author":"Drien","year":"2023","journal-title":"Proc. ACM Manag. Data"},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b36","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1109\/TASE.2008.2003348","article-title":"Port-of-entry inspection: sensor deployment policy optimization","volume":"6","author":"Elsayed","year":"2009","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.dam.2025.07.039_b37","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1613\/jair.3031","article-title":"A model-based active testing approach to sequential diagnosis","volume":"39","author":"Feldman","year":"2010","journal-title":"J. Artificial Intelligence Res."},{"issue":"6","key":"10.1016\/j.dam.2025.07.039_b38","doi-asserted-by":"crossref","first-page":"3237","DOI":"10.1109\/TNET.2017.2725905","article-title":"Determining source\u2013destination connectivity in uncertain networks: Modeling and solutions","volume":"25","author":"Fu","year":"2017","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.dam.2025.07.039_b39","doi-asserted-by":"crossref","unstructured":"L. Fu, X. Wang, P. Kumar, Optimal determination of source-destination connectivity in random graphs, in: Proceedings of the 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2014, pp. 205\u2013214.","DOI":"10.1145\/2632951.2632990"},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b40","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1109\/TNET.2016.2604278","article-title":"Are we connected? Optimal determination of source\u2013destination connectivity in random networks","volume":"25","author":"Fu","year":"2016","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"4","key":"10.1016\/j.dam.2025.07.039_b41","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1080\/10807039.2012.685810","article-title":"Sequential testing of chemicals when costs matter: A value of information approach","volume":"19","author":"Gabbert","year":"2013","journal-title":"Hum. Ecol. Risk Assess.: An Int. J."},{"key":"10.1016\/j.dam.2025.07.039_b42","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0012-365X(73)90113-1","article-title":"Optimal task sequencing with precedence constraints","volume":"4","author":"Garey","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.07.039_b43","article-title":"Nonadaptive stochastic score classification and explainable half-space evaluation","author":"Ghuge","year":"2024","journal-title":"Oper. Res."},{"key":"10.1016\/j.dam.2025.07.039_b44","series-title":"26th Annual European Symposium on Algorithms","first-page":"1","article-title":"The stochastic score classification problem","author":"Gkenosis","year":"2018"},{"key":"10.1016\/j.dam.2025.07.039_b45","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.dam.2021.12.001","article-title":"The stochastic boolean function evaluation problem for symmetric boolean functions","volume":"309","author":"Gkenosis","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.07.039_b46","first-page":"427","article-title":"Adaptive submodularity: Theory and applications in active learning and stochastic optimization","volume":"42","author":"Golovin","year":"2011","journal-title":"J. Artificial Intelligence Res."},{"issue":"10","key":"10.1016\/j.dam.2025.07.039_b47","doi-asserted-by":"crossref","first-page":"3054","DOI":"10.1007\/s00453-022-00982-4","article-title":"Algorithms for the unit-cost stochastic score classification problem","volume":"84","author":"Grammel","year":"2022","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.dam.2025.07.039_b48","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.artint.2005.09.002","article-title":"Finding optimal satisficing strategies for and-or trees","volume":"170","author":"Greiner","year":"2006","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.dam.2025.07.039_b49","series-title":"AAAI\/IAAI","first-page":"725","article-title":"Optimal depth-first strategies for and-or trees","author":"Greiner","year":"2002"},{"key":"10.1016\/j.dam.2025.07.039_b50","doi-asserted-by":"crossref","unstructured":"M. Guo, J. Li, A. Neumann, F. Neumann, H. Nguyen, Limited Query Graph Connectivity Test, in: Proceedings of the AAAI Conference on Artificial Intelligence, 38, 2024, pp. 20718\u201320725.","DOI":"10.1609\/aaai.v38i18.30059"},{"issue":"3","key":"10.1016\/j.dam.2025.07.039_b51","doi-asserted-by":"crossref","first-page":"1437","DOI":"10.1287\/ijoc.2021.1124","article-title":"A general framework for approximating min sum ordering problems","volume":"34","author":"Happach","year":"2022","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.dam.2025.07.039_b52","series-title":"International Workshop on Approximation and Online Algorithms","first-page":"190","article-title":"Adaptivity gaps for the stochastic boolean function evaluation problem","author":"Hellerstein","year":"2022"},{"key":"10.1016\/j.dam.2025.07.039_b53","series-title":"15th Innovations in Theoretical Computer Science Conference","first-page":"61","article-title":"Quickly determining who won an election","author":"Hellerstein","year":"2024"},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b54","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s00453-015-0089-4","article-title":"Max-throughput for (conservative) k-of-n testing","volume":"77","author":"Hellerstein","year":"2017","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2025.07.039_b55","doi-asserted-by":"crossref","unstructured":"H. Kaplan, E. Kushilevitz, Y. Mansour, Learning with attribute costs, in: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, 2005, pp. 356\u2013365.","DOI":"10.1145\/1060590.1060644"},{"key":"10.1016\/j.dam.2025.07.039_b56","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejtl.2023.100111","article-title":"Improving search for gasoline during a hurricane evacuation event using social media","volume":"12","author":"Khare","year":"2023","journal-title":"EURO J. Transp. Logist."},{"key":"10.1016\/j.dam.2025.07.039_b57","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10878-006-9633-0","article-title":"Optimal testing and repairing a failed series system","volume":"12","author":"Kovalyov","year":"2006","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2025.07.039_b58","series-title":"Information Aggregation in Sensor Networks","author":"Kowshik","year":"2011"},{"issue":"4","key":"10.1016\/j.dam.2025.07.039_b59","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1109\/JSAC.2013.130403","article-title":"Optimal computation of symmetric Boolean functions in collocated networks","volume":"31","author":"Kowshik","year":"2013","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.dam.2025.07.039_b60","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s00186-007-0197-2","article-title":"Optimal discrete search with imperfect specificity","volume":"68","author":"Kress","year":"2008","journal-title":"Math. Methods Oper. Res."},{"issue":"5","key":"10.1016\/j.dam.2025.07.039_b61","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TSMCA.2007.893459","article-title":"Bottom-up construction of minimum-cost and\/or trees for sequential fault diagnosis","volume":"37","author":"Kundakcioglu","year":"2007","journal-title":"IEEE Trans. Syst. Man, Cybern.- Part A: Syst. Hum."},{"key":"10.1016\/j.dam.2025.07.039_b62","series-title":"Latin American Symposium on Theoretical Informatics","first-page":"6","article-title":"Querying priced information in databases: The conjunctive case","author":"Laber","year":"2004"},{"key":"10.1016\/j.dam.2025.07.039_b63","series-title":"2012 IEEE International Conference on Industrial Engineering and Engineering Management","first-page":"161","article-title":"Sequential testing policies for complex systems under precedence constraints","author":"Leus","year":"2012"},{"issue":"3","key":"10.1016\/j.dam.2025.07.039_b64","first-page":"3605","article-title":"A novel method for optimal test sequencing under unreliable test based on Markov Decision Process","volume":"35","author":"Liang","year":"2018","journal-title":"J. Intell. Fuzzy Systems"},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b65","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1016\/j.ejor.2019.05.002","article-title":"Searching for multiple objects in multiple locations","volume":"278","author":"Lidbetter","year":"2019","journal-title":"European J. Oper. Res."},{"issue":"8","key":"10.1016\/j.dam.2025.07.039_b66","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1109\/TKDE.2006.131","article-title":"Test strategies for cost-sensitive decision trees","volume":"18","author":"Ling","year":"2006","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"10.1016\/j.dam.2025.07.039_b67","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1109\/24.103000","article-title":"Diagnostic-strategy selection for series systems","volume":"39","author":"Nachlas","year":"1990","journal-title":"IEEE Trans. Reliab."},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b68","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.artmed.2010.12.001","article-title":"Cost-sensitive case-based reasoning using a genetic algorithm: Application to medical diagnosis","volume":"51","author":"Park","year":"2011","journal-title":"Artif. Intell. Med."},{"issue":"3","key":"10.1016\/j.dam.2025.07.039_b69","doi-asserted-by":"crossref","first-page":"2069","DOI":"10.1137\/22M1523492","article-title":"Simple algorithms for stochastic score classification with small approximation ratios","volume":"38","author":"Plank","year":"2024","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.dam.2025.07.039_b70","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1016\/j.ejor.2018.10.036","article-title":"Sequential testing of n-out-of-n systems: Precedence theorems and exact methods","volume":"274","author":"Rostami","year":"2019","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2025.07.039_b71","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ipl.2017.06.011","article-title":"Decision tree classification with bounded number of errors","volume":"127","author":"Saettler","year":"2017","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b72","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1287\/opre.2019.1967","article-title":"A polynomial-time approximation scheme for sequential batch testing of series systems","volume":"70","author":"Segev","year":"2022","journal-title":"Oper. Res."},{"key":"10.1016\/j.dam.2025.07.039_b73","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.cie.2018.02.033","article-title":"Failure detection for series systems when tests are unreliable","volume":"118","author":"Shahmoradi","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.dam.2025.07.039_b74","series-title":"A general framework for sequential batch-testing","author":"Tan","year":"2024"},{"key":"10.1016\/j.dam.2025.07.039_b75","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s10589-019-00121-w","article-title":"Minimizing the average searching time for an object within a graph","volume":"74","author":"Teller","year":"2019","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"10.1016\/j.dam.2025.07.039_b76","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TSMCA.2003.809206","article-title":"Rollout strategies for sequential fault diagnosis","volume":"33","author":"Tu","year":"2003","journal-title":"IEEE Trans. Syst. Man, Cybern.- Part A: Syst. Hum."},{"issue":"142","key":"10.1016\/j.dam.2025.07.039_b77","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.dam.2002.08.001","article-title":"Sequential testing of complex systems: a review","volume":"1","author":"\u00dcnl\u00fcyurt","year":"2004","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.07.039_b78","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10878-005-4106-4","article-title":"Testing systems of identical components","volume":"10","author":"\u00dcnl\u00fcyurt","year":"2005","journal-title":"J. Comb. Optim."},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b79","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/j.ejor.2008.11.034","article-title":"A note on \u201coptimal resource allocation for security in reliability systems\u201d","volume":"199","author":"\u00dcnl\u00fcyurt","year":"2009","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2025.07.039_b80","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2022.108754","article-title":"A general enhancement method for test strategy generation for the sequential fault diagnosis of complex systems","volume":"228","author":"Wang","year":"2022","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"3","key":"10.1016\/j.dam.2025.07.039_b81","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TMC.2011.98","article-title":"Fault localization using passive end-to-end measurements and sequential testing for wireless sensor networks","volume":"11","author":"Wang","year":"2011","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.dam.2025.07.039_b82","series-title":"2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks","first-page":"1","article-title":"Fault localization using passive end-to-end measurement and sequential testing for wireless sensor networks","author":"Wang","year":"2009"},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b83","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.eswa.2012.07.060","article-title":"Sequential testing policies for complex systems under precedence constraints","volume":"40","author":"Wei","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.dam.2025.07.039_b84","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.dam.2017.01.014","article-title":"Minimum-cost diagnostic strategies for k-out-of-n systems with imperfect tests","volume":"222","author":"Wei","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.07.039_b85","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.dss.2017.09.009","article-title":"Test sequencing for sequential system diagnosis with precedence constraints and imperfect tests","volume":"103","author":"Wei","year":"2017","journal-title":"Decis. Support Syst."},{"key":"10.1016\/j.dam.2025.07.039_b86","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.124858","article-title":"Sequential testing in batches with resource constraints","volume":"256","author":"Yang","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"12","key":"10.1016\/j.dam.2025.07.039_b87","doi-asserted-by":"crossref","first-page":"1578","DOI":"10.14778\/2824032.2824055","article-title":"Lenses: An on-demand approach to etl","volume":"8","author":"Yang","year":"2015","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"10.1016\/j.dam.2025.07.039_b88","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.mejo.2014.03.005","article-title":"A novel test optimizing algorithm for sequential fault diagnosis","volume":"45","author":"Yang","year":"2014","journal-title":"Microelectron. J."},{"key":"10.1016\/j.dam.2025.07.039_b89","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2019.07.010","article-title":"Exact and heuristic approaches to detect failures in failed k-out-of-n systems","volume":"112","author":"Yavuz","year":"2019","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.dam.2025.07.039_b90","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/TASE.2009.2022172","article-title":"Multiobjective optimization of a port-of-entry inspection policy","volume":"7","author":"Young","year":"2009","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.dam.2025.07.039_b91","doi-asserted-by":"crossref","first-page":"121306","DOI":"10.1109\/ACCESS.2023.3285763","article-title":"A divide-and-conquer information entropy algorithm for dependency matrix processing","volume":"11","author":"Zhang","year":"2023","journal-title":"IEEE Access"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25004287?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25004287?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,14]],"date-time":"2025-09-14T04:22:47Z","timestamp":1757823767000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X25004287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":91,"alternative-id":["S0166218X25004287"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2025.07.039","relation":{"has-preprint":[{"id-type":"doi","id":"10.2139\/ssrn.5009080","asserted-by":"object"}]},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sequential testing problem: A follow-up review","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2025.07.039","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}