DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems

Recently, deep reinforcement learning (DRL) models have shown promising results in solving NP-hard Combinatorial Optimization (CO) problems. However, most DRL solvers can only scale to a few hundreds of nodes for combinatorial optimization problems on graphs, such as the Traveling Salesman Problem (...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Qiu, Ruizhong, Sun, Zhiqing, Yang, Yiming
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 25.10.2022
Subjects
Online AccessGet full text

Cover

Loading…