1. *R. Fakhimi, H. Validi, I. V. Hicks, T. Terlaky, L. F. Zuluaga. A folding preprocess for the max k-cut problem. Optimization Letters, 19(5): 899-917, 2025. (link) (pdf) (code)
2. *A. Karagoz, *R. Liu, H. Validi. Strengthened MIP formulations for the liver region redesign models of Akshat et al. Optimization Letters, 19(3): 505–525, 2025. (link) (code) (news)
3. *S. Kroger, H. Validi, I. V. Hicks. Maximizing engagement in large-scale social networks. INFORMS Journal on Optimization, 6(3-4):196-213, 2024. (link) (code)
4. *F. Khoshbakhtian, H. Validi, M. Ventresca, D. Aleman. Optimal design of vaccination policies: A case study for Newfoundland and Labrador. Operations Research Letters, 55: 107140, 2024. (link) (pdf) (code)
5. *S. Kroger, H. Validi, I. V. Hicks. A polytime preprocess algorithm for the maximum independent set problem. Optimization Letters, 18(2): 651-661, 2024. (link) (pdf) (code)
6. *J. Zhang, H. Validi, A. Buchanan, I. V. Hicks. Linear-size formulations for connected planar graph partitioning and political districting. Optimization Letters, 18(1): 19-31, 2024. (link) (pdf) (code)
7. *R. Cacao, *L. Cortez, *J. Forner, H. Validi, I. R. de Farias, I. V. Hicks. The set partitioning problem in a quantum context. Optimization Letters, 18(1): 1-17, 2024. (link) (pdf) (code)
8. *R. Fakhimi, H. Validi, I. V. Hicks, T. Terlaky, L. F. Zuluaga. On relaxations of the max k-cut problem formulations. Operations Research Letters, 51.5: 521-527, 2023. (link) (pdf) (code)
9. H. Validi, A. Buchanan. Political districting to minimize cut edges. Mathematical Programming Computation, 14: 623-672, 2022. (link) (pdf) (code)
10. H. Validi, A. Buchanan, E. Lykhovyd. Imposing contiguity constraints in political districting models. Operations Research, 70(2): 867-892, 2022. (link) (pdf) (code) (slides) (video) (poster) (news) (Winner of the 2021 INFORMS Computing Society Harvey J. Greenberg Research Award)
11. H. Validi, A. Buchanan. The optimal design of low-latency virtual backbones. INFORMS Journal on Computing, 32(4): 952-967, 2020. (link) (pdf) (code) (slides) (video)
12. H. Validi, A. Buchanan. A note on "A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs". Networks, 73(1): 135-142, 2019. (link) (pdf) (slides) (poster)
1. R. Fakhimi, H. Validi. Quantum Approximate Optimization Algorithm (QAOA). Encyclopedia of Optimization, March 2023. (link) (pdf)
Imposing Connectivity in Network Design Problems, June 2020. (link) (Winner of the 2023 INFORMS Best Dissertation Award in the Telecommunication and Network Analytics section)
1. *B. Alston, H. Validi, I. V. Hicks. Mixed integer linear optimization formulations for learning optimal binary classification trees. Minor revision at INFORMS Journal on Computing, August 2025. (link) (code)
2. *B. Burin, H. Validi, B. Lyu, I. V. Hicks. Compact mixed integer programming formulations for the minimum biclique cover problem. Major revision at Networks, August 2025. (link) (code)
3. *P. V. Rocha, H. Validi. A cut-based mixed integer programming formulation for the hop-constrained cheapest path problem. Major revision at Optimization Letters, August 2025. (Second place for the Undergraduate Paper Competition at the 2025 IISE OR Division)
4. *S. Kroger, H. Validi, I. V. Hicks, T. Perini. Bounding the number and the diameter of optimal compact Black-majority districts. (link) (code)
5. *J. Zhang, *L. Silveira, H. Validi, L. Smith, A. Buchanan, I. V. Hicks. Partitioning a graph into low-diameter clusters. (link) (code)