2 citations · 2 across the 4 of their papers we have counts for
4 papers
Characterizing QUBO Reformulations of the Max-k-Cut Problem for Quantum Computing
Adrian Harkness, Hamidreza Validi, Ramin Fakhimi +4
Quantum computing offers significant potential for solving NP-hard combinatorial (optimization) problems that are beyond the reach of classical computers. One way to tap into this…
Optimal design of vaccination policies: A case study for Newfoundland and Labrador
Faraz Khoshbakhtian, Hamidreza Validi, Mario Ventresca +1
This paper proposes pandemic mitigation vaccination policies for Newfoundland and Labrador (NL) based on two compact mixed integer programming (MIP) models of the distance-based cr…
On relaxations of the max -cut problem formulations
Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks +2
A tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max -cut problem is a…
Mixed integer linear optimization formulations for learning optimal binary classification trees
Brandon Alston, Hamidreza Validi, Illya V. Hicks
Decision trees are powerful tools for classification and regression that attract many researchers working in the burgeoning area of machine learning. One advantage of decision tree…