 | 2011 |
|---|
| 9 |       | José-Manuel Belenguer,
Enrique Benavent,
Christian Prins,
Caroline Prodhon,
Roberto Wolfler Calvo:
A Branch-and-Cut method for the Capacitated Location-Routing Problem.
Computers & OR 38(6): 931-941 (2011) |
| 8 | | Enrique Benavent,
Angel Corberán,
Isaac Plana,
José M. Sanchis:
New facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem.
Networks 58(4): 255-272 (2011) |
| 2010 |
|---|
| 7 | | José-Manuel Belenguer,
Enrique Benavent,
Nacima Labadi,
Christian Prins,
Mohamed Reghioui:
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic.
Transportation Science 44(2): 206-220 (2010) |
| 2009 |
|---|
| 6 | | Enrique Benavent,
Angel Corberán,
Isaac Plana,
José M. Sanchis:
Min-Max K-vehicles windy rural postman problem.
Networks 54(4): 216-226 (2009) |
| 2007 |
|---|
| 5 | | Enrique Benavent,
Alessandro Carrotta,
Angel Corberán,
José M. Sanchis,
Daniele Vigo:
Lower bounds and heuristics for the Windy Rural Postman Problem.
European Journal of Operational Research 176(2): 855-869 (2007) |
| 2006 |
|---|
| 4 | | José-Manuel Belenguer,
Enrique Benavent,
Philippe Lacomme,
Christian Prins:
Lower and upper bounds for the mixed capacitated arc routing problem.
Computers & OR 33(12): 3363-3383 (2006) |
| 2005 |
|---|
| 3 | | Enrique Benavent,
Angel Corberán,
Estefanía Piñana,
Isaac Plana,
José M. Sanchis:
New heuristic algorithms for the windy rural postman problem.
Computers & OR 32: 3111-3128 (2005) |
| 2003 |
|---|
| 2 | | José-Manuel Belenguer,
Enrique Benavent:
A cutting plane algorithm for the capacitated arc routing problem.
Computers & OR 30(5): 705-728 (2003) |
| 1999 |
|---|
| 1 | | Enrique Benavent,
David Soler:
The Directed Rural Postman Problem with Turn Penalties.
Transportation Science 33(4): 408-418 (1999) |
Data released under the ODC-BY 1.0 license — See also our legal information page