Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms

Roberto Montemanni, János Barta, Derek H. Smith. Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms. In Álvaro Rocha, Ana Maria Ramalho Correia, Hojjat Adeli, Luís Paulo Reis, Marcelo Mendonça Teixeira, editors, New Advances in Information Systems and Technologies - Volume 1 [WorldCIST'16, Recife, Pernambuco, Brazil, March 22-24, 2016]. Volume 444 of Advances in Intelligent Systems and Computing, pages 223-232, Springer, 2016. [doi]

@inproceedings{MontemanniBS16,
  title = {Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms},
  author = {Roberto Montemanni and János Barta and Derek H. Smith},
  year = {2016},
  doi = {10.1007/978-3-319-31232-3_21},
  url = {http://dx.doi.org/10.1007/978-3-319-31232-3_21},
  researchr = {https://researchr.org/publication/MontemanniBS16},
  cites = {0},
  citedby = {0},
  pages = {223-232},
  booktitle = {New Advances in Information Systems and Technologies - Volume 1 [WorldCIST'16, Recife, Pernambuco, Brazil, March 22-24, 2016]},
  editor = {Álvaro Rocha and Ana Maria Ramalho Correia and Hojjat Adeli and Luís Paulo Reis and Marcelo Mendonça Teixeira},
  volume = {444},
  series = {Advances in Intelligent Systems and Computing},
  publisher = {Springer},
  isbn = {978-3-319-31231-6},
}