José-Manuel Belenguer

José-Manuel Belenguer

Auto-generated profile, based on publicly available information

José-Manuel Belenguer

Universitat de València

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2011 in Computers & Operations Research
Verified
Journal Article
Closed access
JBJosé-Manuel Belenguer
José-Manuel Belenguer
EBEnrique Benavent
Enrique Benavent
CPChristian Prins
Christian Prins
CPCaroline Prodhon
Caroline Prodhon
RCRoberto Wolfler Calvo
Roberto Wolfler Calvo

1 July 2016 in Omega
Verified
Journal Article
Closed access
RARamon Alvarez-Valdes
Ramon Alvarez-Valdes
JBJose M. Belenguer
Jose M. Belenguer
EBEnrique Benavent
Enrique Benavent
JBJosé Bermudez
José Bermudez
FMFacundo Muñoz
Facundo Muñoz
FVFrancisco Verdejo
Francisco Verdejo

1 April 1998 in European Journal of Operational Research
Verified
Journal Article
Closed access
PAP. Augerat
P. Augerat
JBJ.M. Belenguer
J.M. Belenguer
EBE. Benavent
E. Benavent
ACA. Corberán
A. Corberán
DND. Naddef
D. Naddef

1 October 2000 in Operations Research
Verified
Journal Article
Closed access
JBJ. M. Belenguer
J. M. Belenguer
MMM. C. Martinez
M. C. Martinez
EME. Mota
E. Mota
In this paper we consider the Split Delivery Vehicle Routing Problem (SDVRP), a relaxation of the known Capacitated Vehicle Routing Problem (CVRP) in which the demand of any client can be serviced by more than one vehicle. We define a feasible solution of this problem, and we show that the convex hull of the associated incidence vectors is a polyhedron (PSDVRP), whose dimension depends on whether a vehicle visiting a client must service, or not, at least one unit of the client demand. From a partial and linear description of PSDVRP and a new family of valid inequalities, we develop a lower bound whose quality is exhibited in the computational results provided, which include the optimal resolution of some known instances—one of them with 50 clients. This instance is, as far as we know, the biggest one solved so far.

1 April 2003 in Computers & Operations Research
Verified
Journal Article
Closed access
JBJosé M. Belenguer
José M. Belenguer
EBEnrique Benavent
Enrique Benavent

1 December 2006 in Computers & Operations Research
Verified
Journal Article
Closed access
JBJosé-Manuel Belenguer
José-Manuel Belenguer
EBEnrique Benavent
Enrique Benavent
PLPhilippe Lacomme
Philippe Lacomme
CPChristian Prins
Christian Prins