World's Best Scientists 2026 revealed!
Ángel Corberán

Ángel Corberán

Overview

Ángel Corberán is affiliated with the University of Valencia in Spain and has contributed extensively to research in engineering and business management. Their work primarily focuses on optimization problems and operational research methods relevant to logistics, supply chain management, and engineering systems.

Their recent research publications cover a variety of topics and have appeared in several notable journals. A selection of papers includes:

  • Arc routing problems: A review of the past, present, and future (2020, Networks)
  • Solving the length constrained K-drones rural postman problem (2020, European Journal of Operational Research)
  • The facility location problem with capacity transfers (2020, Transportation Research Part E Logistics and Transportation Review)
  • On the Distance-Constrained Close Enough Arc Routing Problem (2020, European Journal of Operational Research)
  • The Profitable Close-Enough Arc Routing Problem (2021, Computers & Operations Research)

Frequently coauthoring with other researchers, Ángel Corberán collaborates notably with Isaac Plana and José M. Sanchis, each with nine joint publications, followed by Paula Segura with five, and James F. Campbell and Miguel Reula, each with three coauthored works.

Their work has been published most often in:

  • European Journal of Operational Research
  • Networks
  • Computers & Operations Research
  • Transportation Research Part E Logistics and Transportation Review
  • Computational Optimization and Applications

Ángel Corberán's research spans several fields of study, with a predominant emphasis on engineering and business, management, and accounting. Within these broader disciplines, key subfields include industrial and manufacturing engineering, organizational behavior and human resource management, computer vision and pattern recognition, aerospace engineering, and control and systems engineering.

The main research topics covered in their publications involve:

  • Vehicle Routing Optimization Methods
  • Facility Location and Emergency Management
  • Optimization and Packing Problems
  • Robotic Path Planning Algorithms
  • UAV Applications and Optimization
  • Optimization and Mathematical Programming
  • Sustainable Supply Chain Management

Ángel Corberán's contributions provide extensive insights into optimization challenges and operational methodologies. Their interdisciplinary approach connects theoretical frameworks with practical applications in logistics, engineering, and supply chain systems.

Best Publications

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

    P Augerat;D Naddef;J M Belenguer;E Benavent

  • Heuristic solutions to the problem of routing school buses with multiple objectives

    Ángel Corberán;Elena Fernández;Manuel Laguna;Rafael Martí

  • Separating capacity constraints in the CVRP using tabu search

    P. Augerat;José-Manuel Belenguer;Enrique Benavent;Ángel Corberán

  • The capacitated arc routing problem : lower bounds

    Enrique Benavent;Vicente Campos;Angel Corberán;Enrique Mota

  • Arc Routing: Problems, Methods, and Applications

    Ángel Corberán;Gilbert Laporte

  • Recent results on Arc Routing Problems: An annotated bibliography

    Angel Corberán;Christian Prins

  • A polyhedral approach to the rural postman problem

    A. Corberán;J.M. Sanchis

  • An algorithm for the Rural Postman problem on a directed graph

    Nicos Christofides;V. Campos;A. Corberán;E. Mota

  • Arc routing problems: A review of the past, present, and future

    Ángel Corberán;Richard Eglese;Geir Hasle;Isaac Plana

  • A cutting plane algorithm for the General Routing Problem

    Angel Corberán;Adam N. Letchford;José María Sanchis

  • Heuristics for the mixed rural postman problem

    Angel Corberán;Rafael Martí;Antonio Romero

  • The Rural Postman Problem on mixed graphs with turn penalties

    Angel Corberán;Rafael Martí;Eulalia Martínez;David Soler

  • A GRASP heuristic for the mixed Chinese postman problem

    Angel Corberán;Rafael Martí;José M. Sanchis

  • An optimal method for the mixed postman problem

    N. Christofides;E. Benavent;V. Campos;A. Corberán

  • GRASP for the uncapacitated r-allocation p-hub median problem

    Juanjo Peiró;Ángel Corberán;Rafael Martí

  • Min-Max K-vehicles windy rural postman problem

    Enrique Benavent;Angel Corberán;Isaac Plana;José M. Sanchis

  • A branch & cut algorithm for the windy general routing problem and special cases

    Angel Corberán;Isaac Plana;José M. Sanchis

  • Lower bounds and heuristics for the Windy Rural Postman Problem

    Enrique Benavent;Alessandro Carrotta;Angel Corberán;José M. Sanchis

  • A new metaheuristic for the vehicle routing problem with split demands

    Enrique Mota;Vicente Campos;Ángel Corberán

  • Drone Arc Routing Problems

    James F. Campbell;Ángel Corberán;Isaac Plana;José M. Sanchis

Frequent Co-Authors

Rafael Martí
Rafael Martí University of Valencia
Renata Mansini
Renata Mansini University of Brescia
Claudia Archetti
Claudia Archetti École Supérieure des Sciences Économiques et Commerciales
M. Grazia Speranza
M. Grazia Speranza University of Brescia
Gilbert Laporte
Gilbert Laporte HEC Montréal
Guy Desaulniers
Guy Desaulniers Polytechnique Montréal
Manuel Laguna
Manuel Laguna University of Colorado Boulder
Elena Fernández
Elena Fernández Universitat Politècnica de Catalunya
Gerhard Reinelt
Gerhard Reinelt Heidelberg University
Daniele Vigo
Daniele Vigo University of Bologna

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For Mathematics graduates seeking to expand their career horizons, pursuing advanced degrees can be a strategic move. Many professionals explore one-year MBA programs to gain essential business skills quickly. These programs offer a condensed curriculum that complements analytical strengths gained in a math degree, accelerating career growth in industries like finance and consulting.

Flexibility is another key consideration. For those who have already started graduate studies or earned relevant credits, MBA programs that accept transfer credits provide an efficient pathway to complete a master’s degree without starting from scratch. This option can save time and tuition costs, making further education more accessible.

Careers in data-driven fields are also a natural fit for mathematics majors. The best masters in data analytics programs equip students with practical skills vital for roles in big data, machine learning, and business intelligence. These programs often blend statistical theory with real-world applications, opening doors to lucrative tech careers.

For those balancing busy schedules or seeking less competitive admissions, exploring the easiest MBA programs to get into can be a practical first step. These programs provide valuable credentials and business acumen while maintaining flexible entry standards, enabling a smoother transition from quantitative backgrounds to managerial roles.

Best Scientists Citing Ángel Corberán

Trending Scientists

Recently Published Articles