Learning fine-grained search space pruning and heuristics for combinatorial optimization
Combinatorial optimization problems arise naturally in a wide range of applications from diverse domains. Many of these problems are NP-hard and designing efficient heuristics for …
Journal
Juho Lauri, Sourav Dutta, Marco Grassia, Deepak Ajwani
•
•
1 min read