Constructing covering codes by tabu search

Journal of Combinatorial Designs

Volumn 5, Issue 1, 1997, Pages 71-80

  Östergård, Patric R J ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037899369     PISSN: 10638539     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6610(1997)5:1<71::AID-JCD6>3.0.CO;2-V     Document Type: Article

References (21)

1. E. Aarts and J. Korst, Simulated annealing and Boltzmann machines: A stochastic approach to combinatorial optimization and neural computing, Wiley, Chichester, 1989.
2. A. Blokhuis and C. W. H. Lam, More coverings by rook domains, J. Combin. Theory Ser. A 36 (1984), 240-244.
3. D. Costa, On the use of some known methods for T-colorings of graphs, Ann. Oper. Res. 41 (1993), 343-358.
4. F. Glover, Tabu search - Part 1, ORSA J. Comput. 1 (1989), 190-206.
5. I. S. Honkala and P. R. J. Östergard, "Applications in code design," Local search algorithms, E. H. L. Aarts and J. K. Lenstra (Editors), Wiley, New York, to appear.
6. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, Optimization by simulated annealing: An experimental evaluation: part 1, graph partitioning. Oper. Res. 37 (1989), 865-892.
7. H. J. L. Kamps and J. H. van Lint, The football pool problem for 5 matches, J. Combin. Theory 3 (1967), 315-325.
8. _, "A covering problem," Colloq. Math. Soc. János Bolyai; Hung. Combin. Theory and Appl., Balatonfüred, Hungary, 1969, pp. 679-685.
9. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, Optimization by simulated annealing, Science 220 (1983), 671-680.
10. K.-U. Koschnick, A new upper bound for the football pool problem for nine matches, J. Combin. Theory Ser. A 62 (1993), 162-167.
11. P. J. M. van Laarhoven, E. H. L. Aarts, J. H. van Lint, and L. T. Wille, New upper bounds for the football pool problem for 6, 7, and 8 matches, J. Combin. Theory Ser. A 52 (1989), 304-312.
12. P. S. Laursen, Simulated annealing for the QAP - Optimal tradeoff between simulation time and solution quality, European J. Oper. Res. 69 (1993), 238-243.
13. J. H. van Lint, Jr., Covering radius problems, M.Sc. Thesis, Eindhoven University of Technology, The Netherlands, 1988.
14. P. R. J. Östergård, New upper bounds for the football pool problem for 11 and 12 matches, J. Combin. Theory Ser. A 67 (1994), 161-168.
15. _, New multiple covering codes by tabu search, Austral. J. Combin., 12 (1995), 145-155.
16. _, A combinatorial proof for the football pool problem for six matches, J. Combin. Theory Ser. A, to appear.
17. _, The football pool problem, Congr. Numer., to appear.
18. P. R. J. Östergård and H. O. Hämäläinen, A new table of binary/ternary mixed covering codes, Des. Codes Cryptogr., to appear.
19. C. R. Reeves, Improving the efficiency of tabu search for machine sequencing problems, J. Oper. Res. Soc. 44 (1993), 375-382.
20. E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Comput. 17 (1991), 443-455.
21. L. T. Wille, The football pool problem for 6 matches: A new upper bound obtained by simulated annealing, J. Combin. Theory Ser. A 45 (1987), 171-177.