1 citations · 1 across the 3 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
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…
math.OC2023★ 1 cited
Generating Linear, Semidefinite, and Second-order Cone Optimization Problems for Numerical Experiments
Mohammadhossein Mohammadisiahroudi, Ramin Fakhimi, Brandon Augustino +1
The numerical performance of algorithms can be studied using test sets or procedures that generate such problems. This paper proposes various methods for generating linear, semidef…