Imposing contiguity constraints in political districting models H Validi, A Buchanan, E Lykhovyd Operations Research 70 (2), 867-892, 2022 | 18 | 2022 |
The optimal design of low-latency virtual backbones H Validi, A Buchanan INFORMS Journal on Computing 32 (4), 952-967, 2020 | 6* | 2020 |
A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” H Validi, A Buchanan Networks 73 (1), 135-142, 2019 | 4 | 2019 |
Formulations of the max k-cut problem on classical and quantum computers R Fakhimi, H Validi, IV Hicks, T Terlaky, LF Zuluaga | 1* | 2022 |
Mixed integer linear optimization formulations for learning optimal binary classification trees B Alston, H Validi, IV Hicks arXiv preprint arXiv:2206.04857, 2022 | | 2022 |
Political districting to minimize cut edges H Validi, A Buchanan Mathematical Programming Computation, 1-50, 2022 | | 2022 |