Busque entre los 169128 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-09-27T14:39:26Z | |
dc.date.available | 2012-09-27T14:39:26Z | |
dc.date.issued | 2001 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/21662 | |
dc.description.abstract | Even if simply stated the travelling salesman problem (TSP) is one of the most studied NP-hard problems. Many algorithms have been proposed to solve TSP. Dynamic programming and branch and bound techniques provided the global optimum solution for the largest nontrivial instance of TSP with 7397 cities. However, 4 years of CPU time was required on a network of computers. | en |
dc.language | es | es |
dc.subject | Hybrid evolutionary algorithms | en |
dc.subject | ARTIFICIAL INTELLIGENCE | es |
dc.subject | TSP | en |
dc.subject | Hybrid systems | es |
dc.subject | Algorithms | es |
dc.title | Hybrid evolutionary algorithms for the TSP | en |
dc.type | Objeto de conferencia | es |
sedici.creator.person | Minetti, Gabriela F. | es |
sedici.creator.person | Hugo, Alfonso | es |
sedici.creator.person | Gallard, Raúl Hector | es |
sedici.description.note | Eje: Inteligencia Computacional - Metaheurísticas | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 2001-05 | es |
sedici.relation.event | III Workshop de Investigadores en Ciencias de la Computación | es |
sedici.description.peerReview | peer-review | es |