88 citations · 331 across the 43 of their papers we have counts for
Showing 2016 · cs.AIShow all
2 papers · 2 filters
cs.AI2016
A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover
Tobias Friedrich, Timo Kötzing, Markus Wagner
A common strategy for improving optimization algorithms is to restart the algorithm when it is believed to be trapped in an inferior part of the search space. However, while specif…
cs.AI2016
A case study of algorithm selection for the traveling thief problem
Markus Wagner, Marius Lindauer, Mustafa Misir +2
Many real-world problems are composed of several interacting components. In order to facilitate research on such interactions, the Traveling Thief Problem (TTP) was created in 2013…