Continuous Relaxation Annealing for Combinatorial Optimization
The dataset used in this paper is a collection of combinatorial optimization problems, including MIS and MaxCut problems on random regular graphs (RRGs) with varying degrees.
BibTex:
Before browse our site, please accept our cookies policy