158 citations · 513 across the 30 of their papers we have counts for
34 papers
Fully Automated Generation of Combinatorial Optimisation Systems Using Large Language Models
Daniel Karapetyan
Over the last few decades, researchers have made considerable efforts to make decision support more accessible for small and medium enterprises by reducing the cost of designing, d…
Speeding up deferred acceptance
Gregory Z. Gutin, Daniel Karapetyan, Philip R. Neary +2
A run of the deferred acceptance (DA) algorithm may contain proposals that are sure to be rejected. We introduce the accelerated deferred acceptance algorithm that proceeds in a si…
Bi-objective Optimization in Role Mining
Jason Crampton, Eduard Eiben, Gregory Gutin +2
Role mining is a technique used to derive a role-based authorization policy from an existing policy. Given a set of users , a set of permissions and a user-permission author…
Exploitation Strategies in Conditional Markov Chain Search: A case study on the three-index assignment problem
Sahil Patel, Daniel Karapetyan
The Conditional Markov Chain Search (CMCS) is a framework for automated design of metaheuristics for discrete combinatorial optimisation problems. Given a set of algorithmic compon…
Valued Authorization Policy Existence Problem: Theory and Experiments
Jason Crampton, Eduard Eiben, Gregory Gutin +2
Recent work has shown that many problems of satisfiability and resiliency in workflows may be viewed as special cases of the authorization policy existence problem (APEP), which re…
Solving the Workflow Satisfiability Problem using General Purpose Solvers
Daniel Karapetyan, Gregory Gutin
The workflow satisfiability problem (WSP) is a well-studied problem in access control seeking allocation of authorised users to every step of the workflow, subject to workflow spec…