Enrique Benavent - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2023

A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphsEnrique Benavent, Ángel Corberán, Demetrio Laganà, Francesca Vocaturo. eor, 307(1):64-81, May 2023. [doi]

2019

2016

A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite DepotsJosé-Manuel Belenguer, Enrique Benavent, Antonio Martínez, Christian Prins, Caroline Prodhon, Juan G. Villegas. transci, 50(2):735-749, 2016. [doi]

2015

The multiple vehicle pickup and delivery problem with LIFO constraintsEnrique Benavent, Mercedes Landete, Enrique Mota, Gregorio Tirado. eor, 243(3):752-762, 2015. [doi]

2014

k-vehicle windy rural postman problemEnrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis. networks, 63(1):34-45, 2014. [doi]

2013

Multi-depot Multiple TSP: a polyhedral study and computational resultsEnrique Benavent, Antonio Martínez. anor, 207(1):7-25, 2013. [doi]

2011

A Branch-and-Cut method for the Capacitated Location-Routing ProblemJosé-Manuel Belenguer, Enrique Benavent, Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo. cor, 38(6):931-941, 2011. [doi]

K-vehicles windy rural postman problemEnrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis. networks, 58(4):255-272, 2011. [doi]

2010

Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and MetaheuristicJosé-Manuel Belenguer, Enrique Benavent, Nacima Labadi, Christian Prins, Mohamed Reghioui. transci, 44(2):206-220, 2010. [doi]

A metaheuristic for the min-max windy rural postman problem with K vehiclesEnrique Benavent, Ángel Corberán, José M. Sanchis. cms, 7(3):269-287, 2010. [doi]

2009

Min-Max ::::K::::-vehicles windy rural postman problemEnrique Benavent, Angel CorberÃ¡n, Isaac Plana, JosÃ© M. Sanchis. networks, 54(4):216-226, 2009. [doi]

2007

Lower bounds and heuristics for the Windy Rural Postman ProblemEnrique Benavent, Alessandro Carrotta, Angel Corberán, José M. Sanchis, Daniele Vigo. eor, 176(2):855-869, 2007. [doi]

2006

Lower and upper bounds for the mixed capacitated arc routing problemJosé-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins. cor, 33(12):3363-3383, 2006. [doi]

2005

New heuristic algorithms for the windy rural postman problemEnrique Benavent, Angel Corberán, Estefanía Piñana, Isaac Plana, José M. Sanchis. cor, 32:3111-3128, 2005. [doi]

2003

A cutting plane algorithm for the capacitated arc routing problemJosé-Manuel Belenguer, Enrique Benavent. cor, 30(5):705-728, 2003. [doi]

1999

The Directed Rural Postman Problem with Turn PenaltiesEnrique Benavent, David Soler. transci, 33(4):408-418, 1999. [doi]

1998

Separating capacity constraints in the CVRP using tabu searchP. Augerat, José-Manuel Belenguer, Enrique Benavent, Ángel Corberán, Denis Naddef. eor, 106(2-3):546-557, 1998. [doi]

The Capacitated Arc Routing Problem: Valid Inequalities and FacetsJosé-Manuel Belenguer, Enrique Benavent. coap, 10(2):165-187, 1998. [doi]

1992

The Capacitated Arc Routing Problem: Lower boundsEnrique Benavent, Vicente Campos, Angel Corberán, Enrique Mota. networks, 22(7):669-690, 1992. [doi]

1989

An Exact Algorithm for the Quadratic Assignment Problem on a TreeNicos Christofides, Enrique Benavent. ior, 37(5):760-768, 1989. [doi]

Sign in or sign up to see more results.

runs on WebDSL