Login / Signup

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.

René van BevernTill FluschnikGeorge B. MertziosHendrik MolterManuel SorgeOndrej Suchý
Published in: Discret. Optim. (2018)
Keyphrases
  • optimization problems
  • parameterized complexity
  • cost function
  • objective function
  • evolutionary algorithm
  • combinatorial optimization
  • metaheuristic
  • global constraints
  • directed graph
  • traveling salesman problem