Luis Francisco Hernández Sánchez

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Street sweeping problem (SSP) is a variation of the Windy postman problem (WPP) in which we must construct two tours traversing every edge, and each edge must be traversed once in each direction: one on the first tour and the opposite in the second tour. The computational complexity of this problem remains open. We present a (3/2 α +(More)
  • 1