- -

Browsing by Subject "Branch and cut"

RiuNet: Institutional repository of the Polithecnic University of Valencia

Browsing by Subject "Branch and cut"

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 ...
  • thumb
    The Team Orienteering Arc Routing Problem 
    Archetti, Claudia; Speranza, M. Grazia; Corberan, Angel; Sanchís Llopis, José María; Plana, Isaac (INFORMS (Institute for Operations Research and Management Sciences), 2014-08)
    The team orienteering arc routing problem (TOARP) is the extension to the arc routing setting of the team orienteering problem. In the TOARP, in addition to a possible set of regular customers that have to be serviced, ...