- -

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
    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
    Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem 
    Campbell, James; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula (Springer-Verlag, 2022-09)
    [EN] The Length Constrained K¿Drones Rural Postman Problem (LC K¿DRPP) is a continuous optimization problem where a set of curved or straight lines of a network have to be traversed, in order to be serviced, by a fleet ...
  • thumb
    The multi-purpose K-drones general routing problem 
    Campbell, James; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula (John Wiley & Sons, 2023-12)
    [EN] In this article, we present and solve the multi-pur pose K-drones general routing problem (MP K-DGRP). In this optimization problem, a fleet of multi-pur pose drones, aerial vehicles that can both make deliveries and ...
  • Icon
    The Profitable Close-Enough Arc Routing Problem 
    Bianchessi, Nicola; Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchís Llopis, José María (Elsevier, 2022-04)
    [EN] In this article, we deal with the Profitable Close-Enough Arc Routing Problem (PCEARP), which is an extension of the Close-Enough ARP (CEARP). The CEARP models the situation in which customers are not necessarily nodes ...
  • 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, ...
  • thumb
    Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem 
    Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula (Elsevier, 2024-02)
    [EN] The Rural Postman Problem (RPP) is one of the most well-known problems in arc routing. Given an undirected graph, the RPP consists of finding a closed walk traversing and servicing a given subset of edges with minimum ...