- -

The Profitable Close-Enough Arc Routing Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

  • Estadisticas de Uso

The Profitable Close-Enough Arc Routing Problem

Show full item record

Bianchessi, N.; Corberán, Á.; Plana, I.; Reula, M.; Sanchís Llopis, JM. (2022). The Profitable Close-Enough Arc Routing Problem. Computers & Operations Research. 140:1-14. https://doi.org/10.1016/j.cor.2021.105653

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

Files in this item

Item Metadata

Title: The Profitable Close-Enough Arc Routing Problem
Author: Bianchessi, Nicola Corberán, Ángel Plana, Isaac Reula, Miguel Sanchís Llopis, José María
UPV Unit: Universitat Politècnica de València. Escuela Técnica Superior de Ingenieros Industriales - Escola Tècnica Superior d'Enginyers Industrials
Issued date:
Embargo end date: 2024-12-31
Abstract:
[EN] In this article, we deal with the Profitable Close-Enough Arc Routing Problem (PCEARP), which is an extension of the Close-Enough ARP (CEARP). The CEARP models the situation in which customers are not necessarily nodes ...[+]
Subjects: Arc routing , Close-enough , Profits , Branch and cut , Polyhedra
Copyrigths: Embargado
Source:
Computers & Operations Research. (issn: 0305-0548 )
DOI: 10.1016/j.cor.2021.105653
Publisher:
Elsevier
Publisher version: https://doi.org/10.1016/j.cor.2021.105653
Project ID:
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PGC2018-099428-B-I00/ES/ANALISIS Y RESOLUCION DE PROBLEMAS DE RUTAS DE VEHICULOS Y LOCALIZACION DE SERVICIOS/
Thanks:
The work by Angel Corberan, Isaac Plana, Miguel Reula, and Jose M. Sanchis was supported by the Spanish Ministerio de Ciencia, Innovacion, Universidades (MICIU) and Fondo Social Europeo (FSE), Spain through project ...[+]
Type: Artículo

recommendations

 

This item appears in the following Collection(s)

Show full item record