- -

Browsing by Subject "Branch-and-price"

RiuNet: Institutional repository of the Polithecnic University of Valencia

Browsing by Subject "Branch-and-price"

Sort by: Order: Results:

  • Icon
    A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem 
    Benavent Lopez, Enrique; Corberán, Angel; Desaulniers, Guy; Lessard, François; Plana, Isaac; Sanchís Llopis, José María (John Wiley & Sons, 2014)
    [EN] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. ...
  • thumb
    The min-max close-enough arc routing problem 
    Bianchessi, Nicola; Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchís Llopis, José María (Elsevier, 2022-08-01)
    [EN] Here we introduce the Min-Max Close-Enough Arc Routing Problem, where a fleet of vehicles must serve a set of customers while trying to balance the length of the routes. The vehicles do not need to visit the customers, ...