71 citations · 280 across the 32 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2022★ 1 cited
An ODE approach to multiple choice polynomial programming
Sihong Shao, Yishan Wu
We propose an ODE approach to solving multiple choice polynomial programming (MCPP) after assuming that the optimum point can be approximated by the expected value of so-called the…
math.OC2021
Continuous iterative algorithms for anti-Cheeger cut
Sihong Shao, Chuan Yang
As a judicious correspondence to the classical maxcut, the anti-Cheeger cut has more balanced structure, but few numerical results on it have been reported so far. In this paper, w…
math.OC2018★ 10 cited
A simple iterative algorithm for maxcut
Sihong Shao, Dong Zhang, Weixi Zhang
We propose a simple iterative (SI) algorithm for the maxcut problem through fully using an equivalent continuous formulation. It does not need rounding at all and has advantages th…