- -

Listar por palabra clave "Branch-and-cut"

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

Listar por palabra clave "Branch-and-cut"

Ordenar por:Orden:Resultados:

  • thumb
    A branch-and-cut algorithm for the maximum benefit Chinese postman problem 
    Corberán, Angel; Plana, Isaac; Rodríguez-Chía, Antonio Manuel; Sanchís Llopis, José María (Springer-Verlag, 2013-10)
    [EN] The Maximum Benefit Chinese Postman Problem (MBCPP) is an NP-hard problem that considers several benefits associated with each edge, one for each time the edge is traversed with a service. The objective is to find a ...
  • thumb
    A branch-and-cut algorithm for the Orienteering Arc Routing Problem 
    Archetti, C.; Corberán, A.; Plana, I.; Sanchís Llopis, José María; Speranza, M.G. (Elsevier, 2016)
    [EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be serviced, ...
  • Icon
    A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem 
    Ávila, Thais; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María (INFORMS (Institute for Operations Research and Management Sciences), 2016-05)
    The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an arc routing problem with some interesting real-life applications, such as routing for meter reading. In this article ...
  • thumb
    Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem 
    Ávila, Thais; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María (Springer-Verlag, 2017)
    [EN] The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through ...
  • Icon
    The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm 
    Colombi, Marco; Corberán, Angel; Mansini, Renata; Plana, Isaac; Sanchís Llopis, José María (Elsevier, 2017)
    [EN] The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters' that have to be serviced in a hierarchical order. The problem generalizes ...
  • 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, ...
  • thumb
    Upgrading edges in the Graphical TSP 
    Landete, Mercedes; Plana, Isaac; Sainz-Pardo, José Luis; Sanchís Llopis, José María (Elsevier, 2023-11)
    [EN] In this paper we present a generalization of the Graphical Traveling Salesman Problem (GTSP). Given a communication graph in which not all direct connections are necessarily possible, the Graphical Traveling Salesman ...