| A branch-and-cut algorithm for graph coloring I Méndez-Díaz, P Zabala Discrete Applied Mathematics 154 (5), 826-847, 2006 | 279 | 2006 |
| A branch-and-cut algorithm for the latent-class logit assortment problem I Méndez-Díaz, JJ Miranda-Bront, G Vulcano, P Zabala Discrete Applied Mathematics 164, 246-263, 2014 | 169* | 2014 |
| A cutting plane algorithm for graph coloring I Méndez-Díaz, P Zabala Discrete Applied Mathematics 156 (2), 159-179, 2008 | 134 | 2008 |
| A new formulation for the traveling deliveryman problem I Méndez-Díaz, P Zabala, A Lucena Discrete applied mathematics 156 (17), 3223-3237, 2008 | 116 | 2008 |
| Facets of the graph coloring polytope P Coll, J Marenco, I Méndez Díaz, P Zabala Annals of Operations Research 116, 79-90, 2002 | 68 | 2002 |
| Composite retrieval of diverse and complementary bundles S Amer-Yahia, F Bonchi, C Castillo, E Feuerstein, I Mendez-Diaz, ... IEEE Transactions on Knowledge and Data Engineering 26 (11), 2662-2675, 2014 | 47 | 2014 |
| A cluster-first route-second approach for the swap body vehicle routing problem JJ Miranda-Bront, B Curcio, I Méndez-Díaz, A Montero, F Pousa, P Zabala Annals of Operations Research 253, 935-956, 2017 | 45 | 2017 |
| A polyhedral approach for graph coloring I Méndez Díaz, P Zabala Electronic Notes in Discrete Mathematics 7, 178-181, 2000 | 44 | 2000 |
| An ILP based heuristic for a generalization of the post-enrollment course timetabling problem I Méndez-Díaz, P Zabala, JJ Miranda-Bront Computers & Operations Research 76, 195-207, 2016 | 32 | 2016 |
| Optimization algorithms combining (meta) heuristics and mathematical programming and its application in engineering N Rodríguez, A Gupta, PL Zabala, G Cabrera-Guerrero | 31 | 2018 |
| An integer programming approach for the time-dependent TSP JJ Miranda-Bront, I Mendez-Diaz, P Zabala Electronic Notes in Discrete Mathematics 36, 351-358, 2010 | 30 | 2010 |
| Facets and valid inequalities for the time-dependent travelling salesman problem JJ Miranda-Bront, I Méndez-Díaz, P Zabala European Journal of Operational Research 236 (3), 891-902, 2014 | 28 | 2014 |
| Pickup and delivery problem with incompatibility constraints P Factorovich, I Méndez-Díaz, P Zabala Computers & Operations Research 113, 104805, 2020 | 27 | 2020 |
| Energy‐aware scheduling mandatory/optional tasks in multicore real‐time systems I Méndez‐Díaz, J Orozco, R Santos, P Zabala International Transactions in Operational Research 24 (1-2), 173-198, 2017 | 24 | 2017 |
| A generalization of the graph coloring problem IM Díaz, P Zabala Departamento de Computacion, Universidad de Buenes Aires, 1999 | 14 | 1999 |
| Complexity and algorithms for composite retrieval S Amer-Yahia, F Bonchi, C Castillo, E Feuerstein, I Méndez-Díaz, ... Proceedings of the 22nd International Conference on World Wide Web, 79-80, 2013 | 13 | 2013 |
| Solving a multicoloring problem with overlaps using integer programming I Méndez-Díaz, P Zabala Discrete Applied Mathematics 158 (4), 349-354, 2010 | 11 | 2010 |
| Problemas de ruteo de vehículos P Zabala Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales, 2006 | 10 | 2006 |
| An integer programming approach for the time-dependent TSP. JJM Bront, I Méndez-Díaz, P Zabala Electron. Notes Discret. Math. 36, 351-358, 2010 | 7 | 2010 |
| A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows M Lucci, D Severín, P Zabala International Transactions in Operational Research 30 (2), 970-1001, 2023 | 6 | 2023 |
