Branch-and-bound algorithms for the test cover problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 223-233

  De Bontridder, Koen M J ^a   Lageweg, B J ^b   Lenstra, Jan K ^c   Orlin, James B ^d   Stougie, Leen ^c,e  

^a UTRECHT UNIVERSITY   (Netherlands)

^b ORTEC The Netherlands   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; MEDICINE; TESTING;

BRANCH-AND-BOUND ALGORITHMS; BRANCHING RULES; CODING THEORY; COVER PROBLEM; LOWER BOUNDS; MEDICAL SCIENCE; OPTIMALITY; SEARCH TREES;

BRANCH AND BOUND METHOD;

EID: 84938092533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_23     Document Type: Conference Paper

References (12)

1. H. Y. Chang, E. Manning, G. Metze, Fault diagnosis of digital systems, Wiley, New York, 1970.
2. K. M. J. De Bontridder, Methods for solving the test cover problem, Master’s Thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, February 1997.
3. K. M. J. De Bontridder, B. V. Halldorsson, M. M. Halldorsson, C. A. J. Hurkens, J.K. Lenstra, R. Ravi, L. Stougie, Approximation algorithms for the test cover problem, Submitted for publication, 2002.
4. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
5. A.W.J. Kolen, J.K. Lenstra, Combinatorics in operations research, in R. Graham, M. Grotschel, L. Lovasz (eds.), Handbook of Combinatorics, Elsevier, Amsterdam, 1995, 1875-1910.
6. B.J. Lageweg, J.K. Lenstra, A. H. G. Rinnooy Kan, Uit de practijk van de besliskunde, In A. K. Lenstra, H. W. Lenstra, J. K. Lenstra, editors, Tamelijk briljant; Opstellen aangeboden aan Dr. T.J. Wansbeek. Amsterdam, 1980.
7. B. M. E. Moret, Decision trees and diagrams, Computing Surveys 14, 1982, 593-623.
8. B. M. E. Moret, H. D. Shapiro, On minimizing a set of tests. SIAM Journal on Scientific and Statistical Computing 6, 1985, 983-1003.
9. R. W. Payne, Selection criteria for the construction of efficient diagnostic keys. Journal of Statistical Planning and Information 5, 1981, 27-36.
10. A. Rescigno, G. A. Maccacaro, The information content of biological classification, in C. Cherry (ed.), Information Theory: Fourth London Symposium, But-terworths, London, 1961, 437-445.
11. E. W. Rypka, W. E. Clapper, I. G. Brown, R. Babb, A model for the identification of bacteria. Journal of General Microbiology 46, 1967, 407-424.
12. E. W. Rypka, L. Volkman, E. Kinter, Construction and use of an optimized identification scheme. Laboratory Magazine 9, 1978, 32-41.