Grafos hamiltonianos aplicado al turismo de Panamá
DOI:
https://doi.org/10.37387/ipc.v7i1.12Keywords:
Hamiltonian cycle, Hamiltonian path, Traveling Salesman ProblemAbstract
A classic problem of Graph Theory is to find a path that passes through several points, only once, starting and ending in one place (hamiltonian path). When adding the condition that it is the shortest route, the problem becomes one of type TSP (Traveling Salesman Problem). In this paper we will focus on a tourist tour problem in the city of Panama, transforming it into a graph problem in such a way as to represent the situation posed.
Downloads
Published
How to Cite
Issue
Section
License
1. The Publications Service of the Universidad Católica Santa María La Antigua (the publisher) preserves the patrimonial rights (copyright) of the published works, and favors and allows their reuse.
2. The magazine (and its contents) use Creative Commons licenses, specifically the CC BY NC SA type, where: "the beneficiary of the license has the right to copy, distribute, display and represent the work and make derivative works provided you acknowledge and cite the work in the manner specified by the author or licensor." Abstract: https://creativecommons.org/licenses/by-nc-sa/4.0/ license: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
3. They can be copied, used, disseminated, transmitted and exhibited publicly, provided that: i) the authorship and the original source of its publication (magazine, publisher and URL, DOI of the work) are cited; ii) are not used for commercial purposes.
4. Conditions of self-archiving. Authors are encouraged to electronically disseminate the post-print versions (version evaluated and accepted for publication), as it favors their circulation and dissemination, increases their citation and reach among the academic community.
