Permutation Picture of Graph Combinatorial Optimization Problems
Abstract: This paper proposes a framework that formulates a wide range of graph combinatorial optimization problems using permutation-based representations. These problems include the travelling salesman problem, maximum independent set, maximum cut, and various other related problems. This work potentially opens up new avenues for algorithm design in neural combinatorial optimization, bridging the gap between discrete and continuous optimization techniques.
Submission Length: Regular submission (no more than 12 pages of main content)
Assigned Action Editor: ~Maxime_Gasse2
Submission Number: 3526
Loading