Finding 3-swap-optimal independent sets and dominating sets is hard
Local search problems consist of a set of feasible solutions, an objective function, and a
neighborhood relation which assigns to each feasible solution a set of neighbors. A solution …
neighborhood relation which assigns to each feasible solution a set of neighbors. A solution …
On the complexity of local search problems with scalable neighborhoods
N Morawietz - db-thueringen.de
Local search algorithms are heuristics that find good solutions by computing some starting
solution and afterwards iteratively replacing the current solution with a better one in the local …
solution and afterwards iteratively replacing the current solution with a better one in the local …