-
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. -
Vehicle Routing Problem
The Vehicle Routing Problem (VRP) is a classic problem in combinatorial optimization. The problem is to find the shortest route that visits each node in a graph exactly once and...