15 citations · 33 across the 8 of their papers we have counts for
1 paper · 1 filter
Tim Dernedde, Daniela Thyssens, Sören Dittrich +2
Relevant combinatorial optimization problems (COPs) are often NP-hard. While they have been tackled mainly via handcrafted heuristics in the past, advances in neural networks have…