Enrique Benavent

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