Enrique Benavent Lopez

Enrique Benavent López is an Associate Professor at the Universitat de València, affiliated with the Department of Statistics and Operations Research. His academic career has been dedicated to operations research, particularly in the area of arc routing and combinatorial optimization.

Research Interests:

• Operations Research and Mathematical Programming
• Capacitated Arc Routing Problem (CARP)
• Rural Postman Problem (RPP) and its variants
• Vehicle Routing with Turn Penalties
• Integer Programming and Polyhedral Combinatorics
• Heuristic and Metaheuristic Algorithms

His research spans theoretical algorithm development and practical applications in logistics and transportation. He has made significant contributions to the formulation and solution of hard optimization problems on networks, particularly through cutting-plane methods and branch-and-cut algorithms.

Publication Trends: His work over the past four decades shows a consistent focus on arc routing problems. Early work addressed the quadratic assignment problem and basic postman problems, while later research concentrated on capacitated, windy, and mixed variants with additional constraints. The publications demonstrate a shift from exact methods to hybrid heuristics, reflecting broader trends in the field. His most cited works involve lower bounds, cutting planes, and branch-and-cut for CARP.

Scientific Contributions:

• Developed foundational lower bounds for the Capacitated Arc Routing Problem
• Introduced exact algorithms based on cutting planes and branch-and-cut
• Contributed to the polyhedral analysis of arc routing problems
• Advanced heuristic methods for windy and mixed networks
• Pioneered work on turn penalties in directed rural postman problems

Collaborations and Advising: He has collaborated extensively with leading researchers such as Ángel Corberán, José María Sanchis, and José-Manuel Belenguer. While specific students are not listed, his long-standing research activity suggests he has supervised PhD and Master's students in operations research. He has contributed to major reference works in arc routing and is frequently cited in the literature.

Laboratories and Research Groups: He is part of a strong research group in combinatorial optimization at the Universitat de València, focusing on routing and scheduling problems. This group has produced influential work in both theoretical and applied aspects of operations research.