- -

New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

  • Estadisticas de Uso

New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem

Show full item record

Benavent López, E.; Corberán, A.; Plana, I.; Sanchís Llopis, JM. (2011). New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem. Networks. 58(4):255-272. https://doi.org/10.1002/net.20469

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

Files in this item

Item Metadata

Title: New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem
Author: Benavent López, Enrique Corberán, Angel 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 windy rural postman problem is a multiple vehicle version of the windy rural postman problem, WRPP, which consists of minimizing the length of the longest route to find a set of balanced routes for the ...[+]
Subjects: Facets , Multivehicle , Rural postman problem , Windy postman problem , Windy rural postman problem , Multi-vehicles , Postman problems , Windy rural postman problems , Algorithms
Copyrigths: Reserva de todos los derechos
Source:
Networks. (issn: 0028-3045 )
DOI: 10.1002/net.20469
Publisher:
WILEY-BLACKWELL
Publisher version: https://doi.org/10.1002/net.20469
Project ID:
info:eu-repo/grantAgreement/MICINN//MTM2009-14039-C06-02/ES/Modelos Y Metodos De Programacion Matematica Y Sus Aplicaciones (Optimos2)/
info:eu-repo/grantAgreement/MEC//MTM2006-14961-C05-02/ES/OPTIMOS: OPTIMIZACION PARA LA MOVILIDAD SOSTENIBLE/
Thanks:
Contract grant sponsor: Ministerio de Ciencia e Innovacion of Spain; Contract grant numbers: MTM2006-14961-C05-02, MTM2009-14039-C06-02
Type: Artículo

References

D. Ahr Contributions to multiple postmen problems 2004

Ahr, D., & Reinelt, G. (2002). New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman Problem. Lecture Notes in Computer Science, 64-74. doi:10.1007/3-540-45749-6_10

Ahr, D., & Reinelt, G. (2006). A tabu search algorithm for the min–max k-Chinese postman problem. Computers & Operations Research, 33(12), 3403-3422. doi:10.1016/j.cor.2005.02.011 [+]
D. Ahr Contributions to multiple postmen problems 2004

Ahr, D., & Reinelt, G. (2002). New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman Problem. Lecture Notes in Computer Science, 64-74. doi:10.1007/3-540-45749-6_10

Ahr, D., & Reinelt, G. (2006). A tabu search algorithm for the min–max k-Chinese postman problem. Computers & Operations Research, 33(12), 3403-3422. doi:10.1016/j.cor.2005.02.011

D. Applegate R. E. Bixby V. Chvátal W. Cook Finding cuts in the TSP 1995

Benavent, E., Carrotta, A., Corberán, A., Sanchis, J. M., & Vigo, D. (2007). Lower bounds and heuristics for the Windy Rural Postman Problem. European Journal of Operational Research, 176(2), 855-869. doi:10.1016/j.ejor.2005.09.021

Benavent, E., Corberán, A., Plana, I., & Sanchis, J. M. (2009). Min-Max K -vehicles windy rural postman problem. Networks, 54(4), 216-226. doi:10.1002/net.20334

Benavent, E., Corberán, Á., & Sanchis, J. M. (2009). A metaheuristic for the min–max windy rural postman problem with K vehicles. Computational Management Science, 7(3), 269-287. doi:10.1007/s10287-009-0119-2

Corberáan, A., Letchford, A. N., & Sanchis, J. M. (2001). A cutting plane algorithm for the General Routing Problem. Mathematical Programming, 90(2), 291-316. doi:10.1007/pl00011426

Corberán, A., Plana, I., & Sanchis, J. M. (2007). A branch & cut algorithm for the windy general routing problem and special cases. Networks, 49(4), 245-257. doi:10.1002/net.20176

Corberán, A., Plana, I., & Sanchis, J. M. (2008). The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra. SIAM Journal on Discrete Mathematics, 22(2), 606-628. doi:10.1137/050640886

Frederickson, G. N., Hecht, M. S., & Kim, C. E. (1978). Approximation Algorithms for Some Routing Problems. SIAM Journal on Computing, 7(2), 178-193. doi:10.1137/0207017

Pearn, W. L. (1994). Solvable cases of the k-person Chinese postman problem. Operations Research Letters, 16(4), 241-244. doi:10.1016/0167-6377(94)90073-6

I. Plana The windy general routing problem 2005

[-]

recommendations

 

This item appears in the following Collection(s)

Show full item record