Classification of orthogonal arrays by integer programming

Journal of Statistical Planning and Inference

Volumn 138, Issue 3, 2008, Pages 654-666

  Bulutoglu, D A ^a   Margot, F ^b  

^a Air Force Institute of Technology   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Covering arrays; D optimal designs; Fractional factorial designs; Isomorphism classes; Isomorphism pruning; Orthogonal arrays; Packing arrays

Indexed keywords

EID: 36048982842     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jspi.2006.12.003     Document Type: Article

References (53)

1. Angelopoulos, P., Evangeleras, H., Koukouvinos, C., Lappas, E., 2007. A powerful step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays, Metrika, to appear.
2. Appa, G., Mourtos, I., Magos, D., 2002. Integrating constraint and integer programming for the orthogonal Latin squares problem. In: Van Hentenryck, P. (Ed.), Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 2470. Springer, Berlin, pp. 17-32.
3. Appa G., Magos D., and Mourtos I. A branch & cut algorithm for a for a four-index assignment problem. J. Oper. Res. Soc. 55 (2004) 298-307
4. Avis D. A note on some computationally difficult set covering problems. Math. Programming 8 (1980) 138-145
5. k fractional factorial designs of resolution V. J. Statist. Plann. Inference, accepted for publication.
6. Chateauneuf M., and Kreher D. On the state of strength-tree covering array. J. Combin. Designs 10 (2002) 217-238
7. Cheng C.S. Orthogonal arrays with variable numbers of symbols. Ann. Statist. 8 (1980) 447-453
8. Clark J.B., and Dean A.M. Equivalence of fractional factorial designs. Statist. Sinica 11 (2001) 537-547
9. Cohen D.M., Dalal S.R., Freedman M.L., and Patton G.C. The AETG system: an approach to testing based on combinatorial design. IEEE Trans. Software Eng. 23 7 (1997) 437-444
10. Cohen, D.M., Colbourn, C.J., Gibbons, P.B., Mugridge, W.B., 2003. Constructing test suites for interaction testing. In: Proceedings of the International Conference on Software Engineering (ICSE 03), pp. 38-44.
11. Cohen, D.M., Colbourn, C.J., Ling, A.C.H., 2007. Constructing strength three covering arrays with augmented annealing. Discrete Math., to appear.
12. Colbourn C.J. Combinatorial aspects of covering arrays. Le Mat. (Catania) 58 (2004) 121-167
13. Colbourn, C.J., 2007. Strength two covering arrays: existence tables and projection. Discrete Math., to appear.
14. Colbourn C.J., Cohen M.B., and Turban R.C.A. Deterministic density algorithm for pairwise interaction coverage. Proceedings of the International Conference on Software Engineering (ICSE 04) (2004) 245-252
15. Colbourn C.J., Trung T.V., Martirosyan S.S., and Walker R.A. Roux-type constructions for covering arrays of strength three and four. Designs, Codes and Cryptography 41 (2006) 33-57
16. Dalal S.R., and Mallows C.L. Factor-covering designs for testing software. Technometrics 40 (1998) 234-243
17. Evangelaras H., Koukouvinos C., and Lappas E. Further contributions to nonisomorphic two level orthogonal arrays. J. Statist. Plann. Inference 137 (2007) 2080-2086
18. Fuji Y., Namikawa T., and Yamamoto S. Classification of two-symbol orthogonal arrays of strength t, t + 3 constraints and index 4. II. SUT. J. Math. 25 (1989) 161-177
19. Fulkerson D.R., Nemhauser G.L., and Trotter L.E. Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Math. Programming Study 2 (1974) 72-81
20. Galil Z. Computing D-optimum weighing designs: where statistics combinatorics and computation meet. Proceedings of the Berkeley Conference in Honor of Jerzy Neyman and Jack Kiefer vol. 2 (1985) 635-650
21. Hartman, A., 2002. Software and hardware testing using combinatorial covering suites. In: Haifa Workshop on Interdisciplinary Applications of Graph Theory Combinatorics and Algorithms.
22. Hedayat A., Seiden E., and Stufken J. On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2. J. Statist. Plann. Inference 58 (1997) 43-63
23. Hedayat A., Stufken J., and Su G. On the construction and existence of orthogonal arrays with three levels and indexes 1 and 2. Ann. Statist. 25 (1997) 2044-2053
24. Hedayat A., Sloane N.J.A., and Stufken J. Orthogonal Arrays: Theory and Applications (1999), Springer, New York
25. Hnich B., Prestwich D., Selensky E., and Smith B.M. Constraint models for the covering test problem. Constraints 11 2,3 (2006) 199-219
26. Katona G.O.H. Two applications (for search theory and truth functions) of Sperner type theorems. Period. Math. Hung. 3 (1973) 19-26
27. Kleitman D.J., and Spencer J. Families of k-independent sets. Discrete Math. 6 (1973) 255-262
28. Lam C.W.H., and Tonchev V.D. Classification of affine resolvable 2-(27,9,4) designs. J. Statist. Plann. Inference 56 (1996) 187-202
29. Ma C.X., Fang K.T., and Lin D.K.J. On isomorphism of factorial designs. J. Complexity 17 (2001) 86-97
30. Mannino C., and Sassano A. Solving hard set covering problems. Oper. Res. Lett. 18 (1995) 1-5
31. Margot F. Pruning by isomorphism in branch-and-cut. Math. Programming Ser. A 94 (2002) 71-90
32. Margot F. Exploiting orbits in symmetric ILP. Math. Programming Ser. B 98 (2003) 3-21
33. Margot F. Small covering designs by branch-and-cut. Math. Programming Ser. B 94 (2003) 207-220
34. Margot F. Symmetric ILP: coloring and small integers. Discrete Optim. 4 (2007) 40-62
35. McKay B.D. Nauty Users's Guide (Version 2.2) (2002), Computer Science Department, Australian National University, Canberra
36. Mukerjee R. Universal optimality of fractional factorial plans derivable through orthogonal arrays. Calcutta Statist. Assoc. Bull. 31 (1982) 6-68
37. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1988), Wiley, New York
38. Nguyen N.K., and Miller A.J. A review of some exchange algorithms for constructing discrete D-optimal designs. Comput. Statist. Data Anal. 14 (1992) 489-498
39. Padberg M.W., and Rinaldi G. A branch-and-cut algorithm for the resolution of large scale symmetric travelling salesman problems. SIAM Rev. 33 (1991) 60-100
40. Renyi A. Foundations of Probability (1971), Wiley, New York
41. Seiden E., and Zemach R. On orthogonal arrays. Ann. Math. Statist. 37 (1966) 1355-1370
42. Sloane N.J.A. Covering arrays and intersecting codes. J. Combin. Designs 1 (1993) 51-63
43. Smith B.M. Modeling for constraint programming (2005), First International Summer School on Constraint Programming.
44. Stardom, J., 2001. Metaheuristics and the search for covering and packing arrays. Master's Thesis, Simon Fraser University.
45. Stevens B., and Mendelsohn E. Packing arrays. Theoret. Comput. Sci. 321 (2004) 125-148
46. Stufken, J., Tang, B., 2007. Complete enumeration of two level orthogonal arrays of strength d with d + 2 constraints. Ann. Statist., to appear.
47. Sun, D.X., Li, W., Ye, K.Q., 2002. An algorithm for sequentially constructing nonisomophic orthogonal designs and its applications, preprint.
48. Tai K.C., and Yu L. A test generation strategy for pairwise testing. IEEE T. Software Eng. 28 1 (2002) 109-111
49. Tung Y.W., and Aldiwan W.S. Automating test case generation for the new generation mission software system. Proceedings of IEEE Aerospace Conference (2000) 431-437
50. Williams A.W., and Probert R.L. A practical strategy for testing pair-wise coverage of network interfaces. Proceedings of Seventh International Symposium on Software Reliability Engineering (1996) 246-254
51. Wolsey L.A. Integer Programming (1998), Wiley, New York
52. Wu C.F.J., and Hamada M. Experiments: Planning, Analysis and Parameter Design Optimization (2000), Wiley, New York
53. Xu H., and Wu C.F.J. Generalized minimum aberration for asymmetrical fractional factorial designs. Ann. Statist. 29 (2001) 549-560