Enrique Benavent

发表

The multiple vehicle pickup and delivery problem with LIFO constraints

Enrique Benavent, Mercedes Landete, Enrique Mota, 2015, Eur. J. Oper. Res..

The probabilistic pickup-and-delivery travelling salesman problem

Juan José Salazar González, Enrique Benavent, Mercedes Landete, 2019, Expert Syst. Appl..

Chapter 11: Arc Routing Problems with Min-Max Objectives

Ángel Corberán, Isaac Plana, Enrique Benavent, 2013 .

The Capacitated Arc Routing Problem: Lower bounds

Ángel Corberán, Enrique Benavent, Enrique Mota, 1992, Networks.

Min‐Max K‐vehicles windy rural postman problem

Ángel Corberán, Isaac Plana, José María Sanchis, 2009, Networks.

The Steiner Traveling Salesman Problem and its extensions

Gilbert Laporte, Enrique Benavent, Antonio Martinez-Sykora, 2019, Eur. J. Oper. Res..

The periodic rural postman problem with irregular services on mixed graphs

Ángel Corberán, Demetrio Laganà, Francesca Vocaturo, 2019, Eur. J. Oper. Res..

Chapter 9: The Capacitated Arc Routing Problem: Exact Algorithms

Stefan Irnich, Enrique Benavent, Jose M. Belenguer, 2013 .

Separating capacity constraints in the CVRP using tabu search

Ángel Corberán, José-Manuel Belenguer, Enrique Benavent, 1998, Eur. J. Oper. Res..

A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots

José-Manuel Belenguer, Enrique Benavent, Christian Prins, 2016, Transp. Sci..

The Capacitated Arc Routing Problem: Valid Inequalities and Facets

José-Manuel Belenguer, Enrique Benavent, E. Benavent, 1998, Comput. Optim. Appl..

New facets and an enhanced branch‐and‐cut for the min–max K‐vehicles windy rural postman problem

Ángel Corberán, Isaac Plana, José María Sanchis, 2011, Networks.

RutaRep: a computer package to design dispatching routes in the meat industry

M. C. Martinez, Enrique Benavent, J. M. Belenguer, 2005 .

Linear Programming Based Methods for Solving Arc Routing Problems

Ángel Corberán, Enrique Benavent, José M. Sanchis, 2000 .

Profitable mixed capacitated arc routing and related problems

Ángel Corberán, Maria Cândida Mourão, Enrique Benavent, 2015 .

Multi-depot Multiple TSP: a polyhedral study and computational results

Enrique Benavent, Antonio Martínez, 2013, Ann. Oper. Res..

An Exact Algorithm for the Quadratic Assignment Problem on a Tree

Nicos Christofides, Enrique Benavent, Nicos Christofides, 1989, Oper. Res..

The Directed Rural Postman Problem with Turn Penalties

Enrique Benavent, David Soler, E. Benavent, 1999, Transp. Sci..

A metaheuristic for the min–max windy rural postman problem with K vehicles

Ángel Corberán, José María Sanchis, Enrique Benavent, 2010, Comput. Manag. Sci..

Lower and upper bounds for the mixed capacitated arc routing problem

José-Manuel Belenguer, Philippe Lacomme, Enrique Benavent, 2006, Comput. Oper. Res..

TEORÍA DE GRAFOS (6 cr.) (Optativa en CC. Matemáticas y CC. Estadísticas)

Enrique Benavent, Enrique Benavent, 2008 .

Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

José-Manuel Belenguer, Nacima Labadie, Enrique Benavent, 2010, Transp. Sci..

A Branch and Cut method for the Capacitated Location-Routing Problem

José-Manuel Belenguer, Enrique Benavent, Christian Prins, 2006, 2006 International Conference on Service Systems and Service Management.

New heuristic algorithms for the windy rural postman problem

Ángel Corberán, Isaac Plana, José María Sanchis, 2005, Comput. Oper. Res..

Lower bounds and heuristics for the Windy Rural Postman Problem

Daniele Vigo, Ángel Corberán, José María Sanchis, 2007, Eur. J. Oper. Res..

A cutting plane algorithm for the capacitated arc routing problem

José-Manuel Belenguer, Enrique Benavent, 2003, Comput. Oper. Res..

A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem

Ángel Corberán, Isaac Plana, José María Sanchis, 2014, Networks.

Optimizing the level of service quality of a bike-sharing system

Enrique Benavent, Ramón Alvarez-Valdés, Enriqueta Vercher, 2016 .

A Branch and Cut method for the Capacitated Location-Routing Problem

Enrique Benavent, Caroline Prodhon, Christian Prins, 2006 .

Computational results with a branch and cut code for the capacitated vehicle routing problem

Giovanni Rinaldi, Enrique Benavent, Denis Naddef, 1998 .

An optimal method for the mixed postman problem

Ángel Corberán, Nicos Christofides, Enrique Benavent, 1984 .

Min-Max K-vehicles windy rural postman problem

Ángel Corberán, Isaac Plana, Enrique Benavent, 2009 .

A polyhedral study of the Multi-Depot Multiple TSP

Enrique Benavent, E. Benavent, Antonio Martínez, 2011 .

The capacitated arc routing problem. A heuristic algorithm

Ángel Corberán, Enrique Benavent, Enrique Mota, 1990 .