<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2013-04-29 10:40:39NP-complete problems Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Dominating set A* search algorithm Optimization problem Minimum spanning tree Shortest path problem Treewidth Flow network |
Add to Reading List |
Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg![arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization Alexandre Laterre](https://www.pdfsearch.io/img/fc82b7913ca0093fe7c1f22778317c8f.jpg "arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization Alexandre Laterre")
![Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment](https://www.pdfsearch.io/img/869aefdb3eda27cbac49899f24e2c699.jpg "Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment")
