RESEARCHER PROFILE

Juan A. Dı́az

← Back to Universidad de las Américas Puebla

J

Universidad de las Américas Puebla

Facility Location and Emergency ManagementVehicle Routing Optimization MethodsMetaheuristic Optimization Algorithms ResearchComplexity and Algorithms in GraphsMulti-Agent Systems and Negotiation

Juan A. Dı́az works in Facility Location and Emergency Management, Vehicle Routing Optimization Methods, Metaheuristic Optimization Algorithms Research, Complexity and Algorithms in Graphs, Multi-Agent Systems and Negotiation. Recorded institutional associations include Universidad de las Américas Puebla.

29Publications
1,118Citations
15H-index

Inclusion identifies researchers whose recorded research contributions may inform their university’s understanding of its research community. It does not rank individual research quality or establish current employment.

Selected research works

Up to 100 highly cited works; DOI links open the original research. Counts reflect the collected record, not real-time citation totals.

  1. A compact model and tight bounds for a combined location-routing problem

    2003 · 187 citations
  2. A Tabu search heuristic for the generalized assignment problem

    2001 · 152 citations
  3. Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem

    1999 · 109 citations
  4. Lagrangean relaxation for the capacitated hub location problem with single assignment

    2009 · 106 citations
  5. Hybrid scatter search and path relinking for the capacitated p-median problem

    2004 · 99 citations
  6. Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

    2010 · 97 citations
  7. A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem

    2002 · 67 citations
  8. Scatter search for the single source capacitated facility location problem

    2007 · 61 citations
  9. GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering

    2017 · 39 citations
  10. A novel districting design approach for on-time last-mile delivery: An application on an express postal company

    2022 · 38 citations
  11. Lagrangean duals and exact solution to the capacitated p-center problem

    2009 · 37 citations
  12. A GRASP heuristic for the manufacturing cell formation problem

    2010 · 27 citations
  13. A bi-level maximal covering location problem

    2017 · 24 citations
  14. A dual bounding scheme for a territory design problem

    2013 · 21 citations
  15. Integrated cross-dock door assignment and truck scheduling with handling times

    2020 · 18 citations
  16. An improved exact algorithm for a territory design problem with p-center-based dispersion minimization

    2019 · 11 citations
  17. GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence

    2018 · 5 citations
  18. A hybrid algorithm for the manufacturing cell formation problem

    2013 · 4 citations
  19. Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem

    2023 · 4 citations
  20. Bounding Procedures and Exact Solutions for a Class of Territory Design Problems

    2020 · 3 citations
  21. Computing Semi-Stable Semantics of AF by 0-1 Integer Programming.

    2014 · 2 citations
  22. Math-Heuristic for a Territory Design Problem

    2019 · 2 citations
  23. Computing stable semantics of AF by 0–1 integer programming

    2015 · 1 citations
  24. Primal and dual bounds for the vertex p-median problem with balance constraints

    2016 · 1 citations
  25. Computing Preferred Semantics: Comparing Two ASP Approaches vs an Approach Based on 0-1 Integer Programming

    2014 · 1 citations

← Return to the university profile