- -

A branch-and-cut algorithm for the Orienteering Arc Routing Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A branch-and-cut algorithm for the Orienteering Arc Routing Problem

Show full item record

Archetti, C.; Corberán, A.; Plana, I.; Sanchís Llopis, JM.; Speranza, M. (2016). A branch-and-cut algorithm for the Orienteering Arc Routing Problem. Computers & Operations Research. 66:95-104. https://doi.org/10.1016/j.cor.2015.08.003

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/133517

Files in this item

Item Metadata

Title: A branch-and-cut algorithm for the Orienteering Arc Routing Problem
Author: Archetti, C. Corberán, A. Plana, I. Sanchís Llopis, José María Speranza, M.G.
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
Abstract:
[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, ...[+]
Subjects: Orienteering Arc Routing Problem , Routing problems with profits , Branch-and-cut
Copyrigths: Reserva de todos los derechos
Source:
Computers & Operations Research. (issn: 0305-0548 )
DOI: 10.1016/j.cor.2015.08.003
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.cor.2015.08.003
Project ID:
MINISTERIO DE ECONOMIA Y COMPETITIVIDAD/MTM2012-36163-C06-02
GENERALITAT VALENCIANA. CONSELLERIA D'EDUCACIO, CULTURA I ESPORT/PROMETEO/2013/049
Thanks:
Authors want to thank two anonymous referees for their careful reading of the original paper and their many valuable comments and suggestions that have helped to improve the paper. Angel Corberan, Isaac Plana and Jose M. ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record