The Capacitated Arc Routing Problem: Valid Inequalities and Facets. - José-Manuel Belenguer; Enrique Benavent (Comput. Optim. Appl., 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)

A Lower Bound for the Split Delivery Vehicle Routing Problem. - José-Manuel Belenguer; M. C. Martinez; E. Mota (Oper. Res., 2000)

A cutting plane algorithm for the capacitated arc routing problem. - José-Manuel Belenguer; Enrique Benavent (Comput. Oper. Res., 2003)

Lower and upper bounds for the mixed capacitated arc routing problem. - José-Manuel Belenguer; Enrique Benavent; Philippe Lacomme; Christian Prins (Comput. Oper. Res., 2006)

Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic. - José-Manuel Belenguer; Enrique Benavent; Nacima Labadi; Christian Prins; Mohamed Reghioui (Transp. Sci., 2010)

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)

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)

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., 2023)

A branch-and-cut algorithm for a skip pick-up and delivery problem. - José-Manuel Belenguer; Maximiliano Cubillos; Sanne Wøhlk (Comput. Oper. Res., 2024)