José-Manuel Belenguer

According to our database, José-Manuel Belenguer authored at least 9 papers between 1998 and 2023.

Collaborative distances:

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

2023

Models and algorithms for a yard crane scheduling problem in container ports.

Eva Vallada, José-Manuel Belenguer, Fulgencia Villa, Ramón Alvarez-Valdés

Eur. J. Oper. Res., September, 2023

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

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

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

2003

A cutting plane algorithm for the capacitated arc routing problem.

José-Manuel Belenguer, Enrique Benavent

Comput. Oper. Res., 2003

2000

A Lower Bound for the Split Delivery Vehicle Routing Problem.

José-Manuel Belenguer, M. C. Martinez, E. Mota

Oper. Res., 2000

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