Roberto Quirino do Nascimento

Learn More
This paper deals with the Close-Enough Traveling Salesman Problem (CETSP). In the CETSP, rather than visiting the vertex (customer) itself, the salesman must visit a specific region containing such vertex. To solve this problem, we propose a simple yet effective exact algorithm, based on Branch-and-Bound and Second Order Cone Programming (SOCP). The(More)
This article presents a system for solving location problems , which is integrated with a WebGIS system accessed via a Web browser and Internet connection. This system is meant to generate the matrix of real distances between clients and facilities. The Optimizer System is applied to the problem of locating collection zones and transmission (facilities),(More)
  • 1