Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por palabra clave "Facets"

Mostrando ítems 1-10 de 10

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 ...
Min-Max K-vehicles Windy Rural Postman Problem

Benavent López, Enrique; Corberan, Angel; Plana, Isaac; Sanchís Llopis, José María (John Wiley & Sons, 2009-12)

[EN] In this article the Min-Max version of the windy rural postman problem with several vehicles is introduced. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set ...
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 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 ...
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 ...
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 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, ...
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. ...
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 ...
Zigzag inequalities:a new class of facet-inducing inequalities for Arc Routing Problems

Corberán, A.; Plana, I.; Sanchís Llopis, José María (Springer-Verlag, 2006-08)

[EN] In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigzag inequalities because they cut off ...