@inbook{cab3fd30ca8e4b7a9e29662c97d287fa,
title = "Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms",
abstract = "A considerable amount of research has been devoted to permutation codes in recent years. This has been motivated by some real-world applications. Permutation codes are important because of their robustness against transmission errors and noise. This study addresses the problem of the construction of the largest possible permutation codes with given parameters, namely a specified length and minimum Hamming distance. The problem is modelled in terms of maximum cliques and it is shown how a well-known upper bound based on colouring can be successfully embedded inside a branch and bound method. Experimental results are presented to evaluate the effectiveness of the new idea.",
keywords = "Permutation codes, Maximum clique algorithms, Branch and bound, Colouring bound",
author = "Roberto Montemanni and J{\'a}nos Barta and Smith, {Derek H.}",
year = "2016",
month = mar,
day = "2",
doi = "10.1007/978-3-319-31232-3_21",
language = "English",
isbn = "978-3-319-31231-6",
series = "Advances in Intelligent Systems and Computing ",
publisher = "Springer",
pages = "223--232",
editor = "{\'A}lvaro Rocha and Correia, {Ana Maria } and Hojjat Adeli and Reis, {Luis Paulo} and {Mendon{\c c}a Teixeira}, {Marcelo }",
booktitle = "New Advances in Information Systems and Technologies",
address = "Germany",
}