- -

A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem

Show full item record

Ávila, T.; Corberán, A.; Plana, I.; Sanchís Llopis, JM. (2016). A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem. European Journal of Operational Research. 249(3):1092-1101. https://doi.org/10.1016/j.ejor.2015.10.016

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

Files in this item

Item Metadata

Title: A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem
Author: Ávila, T. Corberán, A. Plana, I. Sanchís Llopis, José María
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
Abstract:
[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, ...[+]
Subjects: Windy rural postman problem , Arc routing , Profits , Branch-and-cut algorithm , Polyhedron
Copyrigths: Cerrado
Source:
European Journal of Operational Research. (issn: 0377-2217 )
DOI: 10.1016/j.ejor.2015.10.016
Publisher:
Elsevier
Publisher version: https://doi.org/10.1016/j.ejor.2015.10.016
Project ID:
MINISTERIO DE ECONOMIA Y COMPETITIVIDAD/MTM2012-36163-C06-02
GENERALITAT VALENCIANA. CONSELLERIA D'EDUCACIO, CULTURA I ESPORT/PROMETEO/2013/049
Thanks:
Authors thank Elisa Schaeffer for providing us with the instances and solutions of sets of instances Set1-Set4 and two anonymous referees for their comments and suggestions that have helped to improve the paper. Authors ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record