3 papers
quant-ph2025
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…
math.OC2023
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…
math.OC2023
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…