On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem.
Isja MannensJesper NederlofCéline M. F. SwennenhuisKrisztina SzilágyiPublished in: CoRR (2021)
Keyphrases
- parameterized complexity
- traveling salesman problem
- fixed parameter tractable
- global constraints
- optimization problems
- genetic algorithm
- ant colony optimization
- np hard
- search space
- information extraction
- connected components
- conjunctive queries
- evolutionary algorithm
- databases
- query language
- particle swarm optimization
- combinatorial optimization
- symmetry breaking