Search Results for author:
Found 11 papers, 0 papers with code
Bi-objective Optimization in Role Mining
We show that the Pareto front of this bi-objective optimization problem (BO-GNRM) can be computed in fixed-parameter tractable time with parameter $\bar{r}+\bar{k}$.
Exploitation Strategies in Conditional Markov Chain Search: A case study on the three-index assignment problem
The Conditional Markov Chain Search (CMCS) is a framework for automated design of metaheuristics for discrete combinatorial optimisation problems.
Solving the Workflow Satisfiability Problem using General Purpose Solvers
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 specification constraints.
Enhancing Security via Deliberate Unpredictability of Solutions in Optimisation
The main aim of decision support systems is to find solutions that satisfy user requirements.
Discrete Mathematics
Hyperparameter Optimisation with Early Termination of Poor Performers
In this paper, we address this challenge by trying to predict the performance of the machine learning system with a given combination of hyperparameters without completing the expensive learning process.
Conditional Markov Chain Search for the Generalised Travelling Salesman Problem for Warehouse Order Picking
The Generalised Travelling Salesman Problem (GTSP) is a well-known problem that, among other applications, arises in warehouse order picking, where each stock is distributed between several locations -- a typical approach in large modern warehouses.
Algorithm Configuration: Learning policies for the quick termination of poor performers
One way to speed up the algorithm configuration task is to use short runs instead of long runs as much as possible, but without discarding the configurations that eventually do well on the long runs.
Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances
Then the process of composition of a metaheuristic from the algorithmic components is reduced to an optimisation problem seeking the best performing CMCS configuration.
Markov Chain methods for the bipartite Boolean quadratic programming problem
We study the Bipartite Boolean Quadratic Programming Problem (BBQP) which is an extension of the well known Boolean Quadratic Programming Problem (BQP).
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints
We also introduce new pseudo-Boolean (PB) and Constraint Satisfaction (CSP) formulations of the WSP with UI constraints which efficiently exploit this new decomposition of the problem and raise the novel issue of how to use general-purpose solvers to tackle FPT problems in a fashion that meets FPT efficiency expectations.
Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem
Multi-mode resource and precedence-constrained project scheduling is a well-known challenging real-world optimisation problem.
