Benavent Enrique

Enrique Benavent

Information about the author Enrique Benavent will soon be added to the site.
Found 11 papers in total
A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
2014
The min‐max k‐vehicles windy rural postman problem consists of...
Multi‐depot Multiple TSP: a polyhedral study and computational results
Multi‐depot Multiple TSP: a polyhedral study and computational results
2013
We study the Multi‐Depot Multiple Traveling Salesman Problem (MDMTSP), which is...
A Branch-and-Cut method for the Capacitated Location-Routing Problem
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
Recent researches in the design of logistic networks have shown that the overall...
A metaheuristic for the min–max windy rural postman problem with K vehicles
A metaheuristic for the min–max windy rural postman problem with K vehicles
2010
In this paper we deal with the min–max version of the windy rural postman...
Split-delivery capacitated arc-routing problem: Lower bound and metaheuristic
Split-delivery capacitated arc-routing problem: Lower bound and metaheuristic
2010
This paper proposes lower and upper bounds for the split-delivery capacitated...
Lower bounds and heuristics for the Windy Rural Postman Problem
Lower bounds and heuristics for the Windy Rural Postman Problem
2007
In this paper we present several heuristic algorithms and a cutting-plane algorithm...
Lower and upper bounds for the mixed capacitated arc routing problem
Lower and upper bounds for the mixed capacitated arc routing problem
2006
This paper presents a linear formulation, valid inequalities, and a lower bounding...
New heuristic algorithms for the windy rural postman problem
New heuristic algorithms for the windy rural postman problem
2005
In this paper we deal with the windy rural postman problem. This problem generalizes...
A cutting plane algorithm for the capacitated arc routing problem
A cutting plane algorithm for the capacitated arc routing problem
2003
The Capacitated Arc Routing Problem (CARP) consists of finding a set of minimum cost...
The capacitated arc routing problem: Valid inequalities and facets
The capacitated arc routing problem: Valid inequalities and facets
1998
In this paper we study the polyhedron associated with the Capacitated Arc Routing...
The directed rural postman problem with turn penalties
The directed rural postman problem with turn penalties
1999
In this paper, we introduce a generalization of the directed rural postman problem...
Papers per page: