RiuNet UPV Home
:
Browsing by Subject

Search RiuNet

Browse

All of RiuNet

My Account

RiuNet Help

Admin. UPV

Browsing by Subject "Branch-and-cut"

Now showing items 1-5 of 5

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-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, ...
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 ...
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 ...
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 ...

Now showing items 1-5 of 5

Browsing by Subject "Branch-and-cut"

RiuNet: Institutional repository of the Polithecnic University of Valencia

Search RiuNet

Browse

All of RiuNet

My Account

RiuNet Help

Admin. UPV

Browsing by Subject "Branch-and-cut"