RiuNet UPV Home
:
Browsing by Author

Search RiuNet

Browse

All of RiuNet

My Account

RiuNet Help

Admin. UPV

Browsing by Author "Corberán, Angel"

Now showing items 1-12 of 12

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 ...
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. ...
A metaheuristic for the min-max Windy Rural Postman Problem with K vehicles

Benavent, Enrique; Corberán, Angel; Sanchís Llopis, José María (Springer-Verlag, 2010)

[EN] In this paper we deal with the min¿max version of the windy rural postman problem with K vehicles. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set of ...
Drone arc routing problems

Campbell, James F.; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María (John Wiley & Sons, 2018)

[EN] In this article, we present some drone arc routing problems (Drone ARPs) and study their relation with well-known postman ARPs. Applications for Drone ARPs include traffic monitoring by flying over roadways, infrastructure ...
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 ...
New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem

Benavent López, Enrique; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María (WILEY-BLACKWELL, 2011-11)

[EN] The min-max windy rural postman problem is a multiple vehicle version of the windy rural postman problem, WRPP, which consists of minimizing the length of the longest route to find a set of balanced routes for the ...
New Results on the Mixed General Routing Problem

Corberán, Angel; Mejía, Gustavo; Sanchís Llopis, José María (Institute for Operations Research and the Management Sciences, 2005-03)

[EN] In this paper, we deal with the polyhedral description and the resolution of the Mixed General Routing Problem. This problem, in which the service activity occurs both at some of the nodes and at some of the arcs and ...
New results on the Windy Postman Problem

Corberán, Angel; Oswald, Marcus; Plana, Isaac; Reinelt, Gerhard; Sanchís Llopis, José María (Springer-Verlag, 2012-04)

[EN] In this paper, we study the Windy Postman Problem (WPP). This is a well-known Arc Routing Problem that contains the Mixed Chinese Postman Problem (MCPP) as a special case. We extend to arbitrary dimension some new ...
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 ...
The mixed general routing polyhedron

Corberán, Angel; Romero Rozalén, Antonio; Sanchís Llopis, José María (Springer-Verlag, 2003)

[EN] In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most ...
The stacker crane problem and the directed general routing problem

Ávila, Thais; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María (John Wiley & Sons, 2015)

[EN] This article deals with the polyhedral description and the resolution of the directed general routing problem (DGRP) and the stacker crane problem (SCP). The DGRP contains a large number of important arc and node ...
The Windy General Routing Polyhedron: A global view of many known Arc Routing Polyhedra

Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María (Society for Industrial and Applied Mathematics, 2008-03-21)

[EN] The windy postman problem consists of finding a minimum cost traversal of all of the edges of an undirected graph with two costs associated with each edge, representing the costs of traversing it in each direction. ...