جست‌وجوی استاد و پژوهشگر

Yuan Zhongمشاهده پروفایل

دانشیار

• Applied Probability
• Stochastic Systems
• Operations Management
• +۷ مورد دیگر

Yuan Zhong is an Associate Professor of Operations Management at the University of Chicago Booth School of Business . He previously held positions as an Assistant Professor at Columbia University’s Department of Industrial Engineering and Operations Research and was a Postdoctoral Scholar at UC Berkeley’s Computer Science Department. Education: PhD in Operations Research, MIT (2012) MA in Mathematics, Caltech (2008) BA in Mathematics, University of Cambridge (2006) His research focuses on applied probability and stochastic system design , with applications in cloud computing , supply chain management , and e-commerce logistics . Recent work explores multi-period production systems and dynamic resource allocation in data centers and healthcare operations . Recent publications analyze cloud value chains , sparse graph design for delivery networks, and process flexibility in manufacturing. He has contributed to journals like Operations Research , Annals of Applied Probability , and Stochastic Systems . Scientific Awards: 2012 Kenneth C. Sevcik Outstanding Student Paper Award Best Student Paper Award at ACM Sigmetrics (2012) He teaches courses in business process fundamentals and queueing theory , with a future schedule including Operations Management: Business Process Fundamentals (2025–2026). No explicit student advising list was provided.

• Operations Research
• Mathematical Programming
• Combinatorial Optimization
• +۶ مورد دیگر

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.

• Operations Research
• Mathematical Programming
• Combinatorial Optimization
• +۷ مورد دیگر

Jose Manuel Belenguer Ribera is a full-time Professor in the Department of Statistics and Operations Research at the University of Valencia. He is a member of the OPTIMATH research group, focusing on optimization and mathematical modelling. His academic career is centered on operations research and combinatorial optimization. His research interests include: Operations Research Mathematical Programming Combinatorial Optimization Vehicle Routing Problems Capacitated Arc Routing Logistics Optimization His publications span from 1990 to 2023, with a strong focus on exact and heuristic methods for routing and scheduling problems. Key contributions include branch-and-cut algorithms, cutting plane methods, and bounds for capacitated and mixed arc routing problems. His recent work extends into port logistics, particularly yard crane scheduling in container terminals. Notable collaborative work includes joint publications with Enrique Benavent, Christian Prins, and Caroline Prodhon. His research has been published in leading journals such as Computers & Operations Research , European Journal of Operational Research , and Operations Research . He earned his PhD from the University of Valencia in 1990 with a thesis on the polyhedron of capacitated arc routing problems, establishing a strong foundation in polyhedral combinatorics.

• Operations Research
• Mathematical Programming
• Combinatorial Optimization
• +۹ مورد دیگر

Vicente Campos Aucejo is a Titular de Universidad (Associate Professor) in the Department of Statistics and Operations Research at the Universitat de València . He holds a Ph.D. in Mathematics, awarded in 1982 for his thesis on optimal Eulerian circuits and the mixed postman problem, supervised by Dr. Marco A. López Cerdá. His academic career is deeply rooted in combinatorial optimization and operations research. His primary research interests lie in arc routing problems , vehicle routing , matrix bandwidth minimization , and permutation problems . He is a leading expert in metaheuristic methods, particularly tabu search , GRASP (Greedy Randomized Adaptive Search Procedure), and scatter search , applying these techniques to solve complex NP-hard optimization problems. His work bridges theoretical developments with practical algorithmic implementations. An analysis of his 15 most recent publications reveals a consistent focus on combinatorial optimization using metaheuristics . His research spans applications in graph theory (e.g., hull number, dispersion problems), algorithm design (e.g., branch and bound, adaptive memory programming), and comparative studies of optimization frameworks (e.g., GRASP vs. genetic algorithms). The dominant keywords across his work are Operations Research, Computer Science, and Combinatorics, with a clear emphasis on developing and refining heuristic and exact solution methods. Collaboration is a hallmark of his research. He has co-authored extensively with prominent scholars such as Rafael Martí , Manuel Laguna , Angel Corberán , and Fred Glover , indicating strong international ties and integration within the optimization research community. His work is regularly published in high-impact journals like the European Journal of Operational Research , Computers & Operations Research , and Discrete Applied Mathematics . While specific details about student advising, grants, or laboratory affiliations are not available in the provided text, his long-standing publication record and senior academic title suggest a significant role in mentoring and research leadership. There is no indication of any scientific awards in the provided information.

• Operations Research
• Mathematical Programming
• Arc Routing Problems
• +۵ مورد دیگر

Angel José Corberán Salvador is a Professor in the Department of Statistics and Operations Research at the University of Valencia. He earned his Ph.D. from the same institution in 1982 with a thesis on optimal Eulerian circuits and the rural postman problem. His academic career is centered on operations research and combinatorial optimization. Ph.D., University of Valencia, 1982 His research focuses on arc routing problems, including the rural postman, capacitated arc routing, and general routing problems. He has made significant contributions to polyhedral analysis, exact algorithms, and heuristics for these problems. His work extends to variants such as windy, mixed, and distance-constrained routing, as well as modern applications involving drones and hub location. He has published extensively in leading journals like European Journal of Operational Research , Networks , and Computers & Operations Research . The recent articles highlight a strong trend in extending classical arc routing models to modern logistics challenges, including drone-based delivery (K-drones routing), close-enough routing, and equitable hub location. The methodologies employed span exact approaches like branch-and-cut and branch-price-and-cut, as well as heuristic and matheuristic methods. The research is deeply rooted in mathematical programming and combinatorial optimization, with applications in transportation and network design. No scientific awards are mentioned in the provided text. Angel Corberán has collaborated extensively with researchers such as José María Sanchis, Isaac Plana, and Enrique Benavent. While no specific grants are listed, his sustained publication record suggests successful research funding. He has likely supervised several Ph.D. students given his senior academic position and prolific output, though no names are provided. No information about specific labs or research teams is available in the provided content.

Rafael Martí Cunqueroمشاهده پروفایل

استاد

• Operations Research
• Mathematical Programming
• Combinatorial Optimization
• +۸ مورد دیگر

Rafael Martí Cunquero is a Full Professor ( Catedrático de Universidad ) in the Department of Statistics and Operations Research at the Faculty of Mathematics, University of Valencia, Spain. He leads the OPTIMATH Optimization and Mathematical Modelling research group and maintains an active research profile with a focus on optimization and heuristics. Research Interests: His primary fields of interest include Operations Research, Combinatorial Optimization, Metaheuristics (especially Scatter Search, GRASP, and Tabu Search), Global Optimization, Graph Drawing, and Network Design. His work bridges theoretical development and practical application in complex decision-making problems. The analysis of his recent publications reveals a consistent focus on developing and applying advanced metaheuristic methods—particularly hybridizations of GRASP, path relinking, scatter search, and variable neighborhood search—to challenging combinatorial optimization problems. Key application areas include graph drawing (e.g., edge crossing minimization), location problems (e.g., p-median, hub location), diversity and dispersion maximization, and routing. His work often emphasizes both algorithmic innovation and empirical validation. Dr. Martí has made substantial contributions to the field, co-authoring foundational texts on scatter search and editing comprehensive handbooks on heuristics. His research is supported by extensive collaborations, particularly with Manuel Laguna, Fred Glover, and Abraham Duarte.

• Operations Research
• Transportation Planning
• Optimization Problems
• +۳ مورد دیگر

Ramon Piedra de la Cuadra is an Assistant Professor in the Integrated Sciences Department at the College of Engineering, Universidad de Huelva. His research focuses on operations research, transportation planning, and sustainable waste management, applying advanced optimization techniques to urban mobility and environmental logistics. Research Interests: Transportation network optimization Bilevel programming for infrastructure deployment Time-dependent routing algorithms Mathematical modeling for sustainability Heuristic and matheuristic methods Publication Trends: Recent works emphasize electric vehicle charging station placement, eco-tourism route design, and multi-compartment waste collection models. Earlier research explores rail transit strategies, entropic analysis for sprawled cities, and mathematical education challenges.