- -

A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem

Show full item record

Benavent López, E.; Corberán, A.; Desaulniers, G.; Lessard, F.; Plana, I.; Sanchís Llopis, JM. (2014). A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem. Networks. 63(1):34-45. doi:10.1002/net.21520

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

Files in this item

Item Metadata

Title: A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem
Author: Benavent Lopez, Enrique Corberán, Angel Desaulniers, Guy Lessard, François Plana, Isaac 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] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. ...[+]
Subjects: Rural postman problem , Windy rural postman problem , Multivehicle , Column generation , Branch-and-price , Cutting planes
Copyrigths: Cerrado
Source:
Networks. (issn: 0028-3045 )
DOI: 10.1002/net.21520
Publisher:
John Wiley & Sons
Publisher version: https://doi.org/10.1002/net.21520
Thanks:
Contract grant sponsor: Ministerio de Education y Ciencia of Spain: Contract gram number: MTM2006-14961-C05-02 Canadian Natural Sciences and Engineering Research Council; Contract grant number: 157935-07
Type: Artículo

This item appears in the following Collection(s)

Show full item record