- -

Browsing by Subject "Close-enough"

RiuNet: Institutional repository of the Polithecnic University of Valencia

Browsing by Subject "Close-enough"

Sort by: Order: Results:

  • thumb
    On the Distance-Constrained Close Enough Arc Routing Problem 
    Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchís Llopis, José María (Elsevier, 2021-05-16)
    [EN] Arc routing problems consist basically of finding one or several routes traversing a given set of arcs and/or edges that must be serviced. The Close-Enough Arc Routing Problem, or Generalized Directed Rural Postman ...