Continuous Relaxation Annealing for Combinatorial Optimization

doi:doi:10.57702/oiu9mkp7

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.

Data and Resources

Original MetadataJSON
The json representation of the dataset with its distributions based on DCAT.
Explore
- Preview
- Download

Cite this as

Yuma Ichikawa, Yuma Ichikawa, Yuma Ichikawa, Yuma Ichikawa (2024). Dataset: Continuous Relaxation Annealing for Combinatorial Optimization. https://doi.org/10.57702/oiu9mkp7

DOI retrieved: December 16, 2024

Additional Info

Field	Value
Created	December 16, 2024
Last update	December 16, 2024
Defined In	https://doi.org/10.48550/arXiv.2309.16965
Author	Yuma Ichikawa
More Authors	Yuma Ichikawa Yuma Ichikawa Yuma Ichikawa