- -

Listar por palabra clave "Cutting planes"

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Listar por palabra clave "Cutting planes"

Ordenar por:Orden:Resultados:

  • 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
    A cutting plane algorithm for the General Routing Problem 
    Corberan, Angel; Letchford, Adam; Sanchís Llopis, José María (Springer-Verlag, 2001)
    [EN] The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural ...
  • Icon
    Lower bounds and heuristics for the Windy Rural Postman Problem 
    Benavent, E.; Carrotta, A.; Corberán, A.; Sanchís Llopis, José María; Vigo, D. (Elsevier, 2020-01-16)
    [EN] In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains several important Arc Routing Problems as special cases and has very ...