Enrique Benavent

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 5

Top Topics

Vehicle Tracking

Valid Inequalities

Binary Particle Swarm Optimization

Routing Problem

Top Venues

Eur. J. Oper. Res.

Ann. Oper. Res.

Expert Syst. Appl.

Publications

Enrique Benavent, Ángel Corberán, Demetrio Laganà, Francesca Vocaturo
A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs. Eur. J. Oper. Res. 307 (1) (2023)
Enrique Benavent, Ángel Corberán, Demetrio Laganà, Francesca Vocaturo
The periodic rural postman problem with irregular services on mixed graphs. Eur. J. Oper. Res. 276 (3) (2019)
Jessica Rodríguez-Pereira, Elena Fernández, Gilbert Laporte, Enrique Benavent, Antonio Martinez-Sykora
The Steiner Traveling Salesman Problem and its extensions. Eur. J. Oper. Res. 278 (2) (2019)
Enrique Benavent, Mercedes Landete, Juan José Salazar González, Gregorio Tirado
The probabilistic pickup-and-delivery travelling salesman problem. Expert Syst. Appl. 121 (2019)
José-Manuel Belenguer, Enrique Benavent, Antonio Martínez, Christian Prins, Caroline Prodhon, Juan G. Villegas
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots. Transp. Sci. 50 (2) (2016)
Enrique Benavent, Mercedes Landete, Enrique Mota, Gregorio Tirado
The multiple vehicle pickup and delivery problem with LIFO constraints. Eur. J. Oper. Res. 243 (3) (2015)
Enrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis
-vehicle windy rural postman problem. Networks 63 (1) (2014)
Enrique Benavent, Antonio Martínez
Multi-depot Multiple TSP: a polyhedral study and computational results. Ann. Oper. Res. 207 (1) (2013)
Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis
-vehicles windy rural postman problem. Networks 58 (4) (2011)
José-Manuel Belenguer, Enrique Benavent, Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo
A Branch-and-Cut method for the Capacitated Location-Routing Problem. Comput. Oper. Res. 38 (6) (2011)
Enrique Benavent, Ángel Corberán, José M. Sanchis
A metaheuristic for the min-max windy rural postman problem with K vehicles. Comput. Manag. Sci. 7 (3) (2010)
José-Manuel Belenguer, Enrique Benavent, Nacima Labadi, Christian Prins, Mohamed Reghioui
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic. Transp. Sci. 44 (2) (2010)
Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis
-vehicles windy rural postman problem. Networks 54 (4) (2009)
Enrique Benavent, Alessandro Carrotta, Angel Corberán, José M. Sanchis, Daniele Vigo
Lower bounds and heuristics for the Windy Rural Postman Problem. Eur. J. Oper. Res. 176 (2) (2007)
José-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins
Lower and upper bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 33 (12) (2006)
Enrique Benavent, Angel Corberán, Estefanía Piñana, Isaac Plana, José M. Sanchis
New heuristic algorithms for the windy rural postman problem. Comput. Oper. Res. 32 (2005)
José-Manuel Belenguer, Enrique Benavent
A cutting plane algorithm for the capacitated arc routing problem. Comput. Oper. Res. 30 (5) (2003)
Enrique Benavent, David Soler
The Directed Rural Postman Problem with Turn Penalties. Transp. Sci. 33 (4) (1999)
P. Augerat, José-Manuel Belenguer, Enrique Benavent, Ángel Corberán, Denis Naddef
Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. 106 (2-3) (1998)
José-Manuel Belenguer, Enrique Benavent
The Capacitated Arc Routing Problem: Valid Inequalities and Facets. Comput. Optim. Appl. 10 (2) (1998)
Enrique Benavent, Vicente Campos, Angel Corberán, Enrique Mota
The Capacitated Arc Routing Problem: Lower bounds. Networks 22 (7) (1992)
Nicos Christofides, Enrique Benavent
An Exact Algorithm for the Quadratic Assignment Problem on a Tree. Oper. Res. 37 (5) (1989)