In this work, we present an attention-based encoder–decoder model to approximately solve the team orienteering problem with multiple depots (TOPMD). The TOPMD instance is an NP-hard combinatorial ...

Graph matching (GM) has been a long-standing combinatorial problem due to its NP-hard nature. Recently (deep) learning-based approaches have shown their superiority over the traditional solvers while ...