Design and Use of the CPAN Branch & Bound for the Solution of the Travelling Salesman Problem (TSP)

Manuel I. Capel Tuñón, Mario Rossainz López. Design and Use of the CPAN Branch & Bound for the Solution of the Travelling Salesman Problem (TSP). In 15th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2005), 28 February 2005 - 2 March 2005, Puebla, Mexico. pages 262-267, IEEE Computer Society, 2005. [doi]

@inproceedings{TunonL05,
  title = {Design and Use of the CPAN Branch & Bound for the Solution of the Travelling Salesman Problem (TSP)},
  author = {Manuel I. Capel Tuñón and Mario Rossainz López},
  year = {2005},
  url = {http://csdl.computer.org/comp/proceedings/conielecomp/2005/2283/00/22830262abs.htm},
  tags = {design},
  researchr = {https://researchr.org/publication/TunonL05},
  cites = {0},
  citedby = {0},
  pages = {262-267},
  booktitle = {15th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2005), 28 February 2005 - 2 March 2005, Puebla, Mexico},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-2283-1},
}