activity
20082026
most citedA Memetic Algorithm for the Generalized Traveling Salesman Problem

158 citations · 391 across the 15 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.AI2016

Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints

Daniel Karapetyan, Andrew J. Parkes, Gregory Gutin +1

The fixed parameter tractable (FPT) approach is a powerful tool in tackling computationally hard problems. In this paper, we link FPT results to classic artificial intelligence (AI…