Uma Metaheurística GRASP/VNS para uma Solução Aproximada do Problema de Recobrimento de Rotas

Authors

  • L.C.S. Motta
  • L.S. Ochi
  • C.A. Martinhon

DOI:

https://doi.org/10.5540/tema.2001.02.01.0145

Abstract

O Problema de Recobrimento de Rotas (PRR) é um problema de sequenciamento de tarefas dividido sob um grafo G = (V U W,E), onde W é o conjunto de vértices que devem ser descobertos.

Downloads

Published

2001-06-01

How to Cite

Motta, L., Ochi, L., & Martinhon, C. (2001). Uma Metaheurística GRASP/VNS para uma Solução Aproximada do Problema de Recobrimento de Rotas. Trends in Computational and Applied Mathematics, 2(1), 145–154. https://doi.org/10.5540/tema.2001.02.01.0145

Issue

Vol. 2 No. 1 (2001)

Section

Original Article

License

Copyright

Authors of articles published in the journal Trends in Computational and Applied Mathematics retain the copyright of their work. The journal uses Creative Commons Attribution (CC-BY) in published articles. The authors grant the TCAM journal the right to first publish the article.

Intellectual Property and Terms of Use

The content of the articles is the exclusive responsibility of the authors. The journal uses Creative Commons Attribution (CC-BY) in published articles. This license allows published articles to be reused without permission for any purpose as long as the original work is correctly cited.

The journal encourages Authors to self-archive their accepted manuscripts, publishing them on personal blogs, institutional repositories, and social media, as long as the full citation is included in the journal's website version.