Exploratory combinatorial optimization with reinforcement learning
Many real-world problems can be reduced to combinatorial optimization on a graph, where the subset or ordering of vertices that maximize some objective function must be found. With such tasks often NP-hard and analytically intractable, reinforcement learning (RL) has shown promise as a framework wit...
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Conference item |
| Kieli: | English |
| Julkaistu: |
Association for the Advancement of Artificial Intelligence
2020
|