2008 |
12 | EE | Angel Corberán,
Isaac Plana,
José M. Sanchis:
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra.
SIAM J. Discrete Math. 22(2): 606-628 (2008) |
2007 |
11 | EE | Enrique Mota,
Vicente Campos,
Angel Corberán:
A New Metaheuristic for the Vehicle Routing Problem with Split Demands.
EvoCOP 2007: 121-129 |
10 | EE | 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) |
9 | EE | Angel Corberán,
Isaac Plana,
José M. Sanchis:
A branch & cut algorithm for the windy general routing problem and special cases.
Networks 49(4): 245-257 (2007) |
2006 |
8 | EE | Angel Corberán,
Enrique Mota,
José M. Sanchis:
A comparison of two different formulations for arc routing problems on mixed graphs.
Computers & OR 33(12): 3384-3402 (2006) |
7 | EE | Angel Corberán,
Isaac Plana,
José M. Sanchis:
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems.
Math. Program. 108(1): 79-96 (2006) |
2005 |
6 | EE | 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 |
5 | EE | Angel Corberán,
Antonio Romero,
José M. Sanchis:
The mixed general routing polyhedron.
Math. Program. 96(1): 103-137 (2003) |
4 | EE | Angel Corberán,
Enrique Mota,
Juan José Salazar:
Some recent contributions to routing and location problems.
Networks 42(2): 109-113 (2003) |
2002 |
3 | EE | Angel Corberán,
Rafael Martí,
Eulalia Martínez,
David Soler:
The Rural Postman Problem on mixed graphs with turn penalties.
Computers & OR 29(7): 887-903 (2002) |
2 | EE | Angel Corberán,
Rafael Martí,
José M. Sanchis:
A GRASP heuristic for the mixed Chinese postman problem.
European Journal of Operational Research 142(1): 70-80 (2002) |
2000 |
1 | EE | Angel Corberán,
Rafael Martí,
Antonio Romero:
Heuristics for the Mixed Rural Postman Problem.
Computers & OR 27(2): 183-203 (2000) |