The following pages link to Enrique Benavent (Q319192):
Displaying 25 items.
- The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
- A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- (Q1384094) (redirect page) (← links)
- The capacitated arc routing problem: Valid inequalities and facets (Q1384095) (← links)
- Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
- The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
- A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
- The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- New heuristic algorithms for the windy rural postman problem (Q2387296) (← links)
- Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
- A branch-price-and-cut algorithm for the min-max<i>k</i>-vehicle windy rural postman problem (Q2811322) (← links)
- Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
- New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
- (Q3337973) (← links)
- The Capacitated Arc Routing Problem: Lower bounds (Q4022732) (← links)
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree (Q4732306) (← links)
- (Q4762468) (← links)
- The Directed Rural Postman Problem with Turn Penalties (Q4950871) (← links)
- (Q5271456) (← links)
- (Q5271458) (← links)
- (Q5323400) (← links)
- A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs (Q6106965) (← links)
