Enrique Benavent

According to our database, Enrique Benavent authored at least 22 papers between 1989 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs.

Enrique Benavent, Ángel Corberán, Demetrio Laganà, Francesca Vocaturo

Eur. J. Oper. Res., May, 2023

2019

The probabilistic pickup-and-delivery travelling salesman problem.

Enrique Benavent, Mercedes Landete, Juan José Salazar González, Gregorio Tirado

Expert Syst. Appl., 2019

The Steiner Traveling Salesman Problem and its extensions.

Jessica Rodríguez-Pereira, Elena Fernández, Gilbert Laporte, Enrique Benavent, Antonio Martinez-Sykora

Eur. J. Oper. Res., 2019

The periodic rural postman problem with irregular services on mixed graphs.

Enrique Benavent, Ángel Corberán, Demetrio Laganà, Francesca Vocaturo

Eur. J. Oper. Res., 2019

2016

A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots.

José-Manuel Belenguer, Enrique Benavent, Antonio Martínez, Christian Prins, Caroline Prodhon, Juan G. Villegas

Transp. Sci., 2016

2015

The multiple vehicle pickup and delivery problem with LIFO constraints.

Enrique Benavent, Mercedes Landete, Enrique Mota, Gregorio Tirado

Eur. J. Oper. Res., 2015

2014

A branch-price-and-cut algorithm for the min-max <i>k</i>-vehicle windy rural postman problem.

Enrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis

Networks, 2014

2013

Multi-depot Multiple TSP: a polyhedral study and computational results.

Enrique Benavent, Antonio Martínez

Ann. Oper. Res., 2013

2011

New facets and an enhanced branch-and-cut for the min-max <i>K</i>-vehicles windy rural postman problem.

Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis

Networks, 2011

A Branch-and-Cut method for the Capacitated Location-Routing Problem.

José-Manuel Belenguer, Enrique Benavent, Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo

Comput. Oper. Res., 2011

2010

Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic.

José-Manuel Belenguer, Enrique Benavent, Nacima Labadi, Christian Prins, Mohamed Reghioui

Transp. Sci., 2010

A metaheuristic for the min-max windy rural postman problem with K vehicles.

Enrique Benavent, Ángel Corberán, José M. Sanchis

Comput. Manag. Sci., 2010

2009

Min-Max <i>K</i>-vehicles windy rural postman problem.

Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis

Networks, 2009

2007

Lower bounds and heuristics for the Windy Rural Postman Problem.

Enrique Benavent, Alessandro Carrotta, Angel Corberán, José M. Sanchis, Daniele Vigo

Eur. J. Oper. Res., 2007

2006

Lower and upper bounds for the mixed capacitated arc routing problem.

José-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins

Comput. Oper. Res., 2006

2005

New heuristic algorithms for the windy rural postman problem.

Enrique Benavent, Angel Corberán, Estefanía Piñana, Isaac Plana, José M. Sanchis

Comput. Oper. Res., 2005

2003

A cutting plane algorithm for the capacitated arc routing problem.

José-Manuel Belenguer, Enrique Benavent

Comput. Oper. Res., 2003

1999

The Directed Rural Postman Problem with Turn Penalties.

Enrique Benavent, David Soler

Transp. Sci., 1999

1998

Separating capacity constraints in the CVRP using tabu search.

P. Augerat, José-Manuel Belenguer, Enrique Benavent, Ángel Corberán, Denis Naddef

Eur. J. Oper. Res., 1998

The Capacitated Arc Routing Problem: Valid Inequalities and Facets.

José-Manuel Belenguer, Enrique Benavent

Comput. Optim. Appl., 1998

1992

The Capacitated Arc Routing Problem: Lower bounds.

Enrique Benavent, Vicente Campos, Angel Corberán, Enrique Mota

Networks, 1992

1989

An Exact Algorithm for the Quadratic Assignment Problem on a Tree.

Nicos Christofides, Enrique Benavent

Oper. Res., 1989