no code implementations • 25 Mar 2024 • Jason Crampton, Eduard Eiben, Gregory Gutin, Daniel Karapetyan, Diptapriyo Majumdar
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}$.
no code implementations • 30 Jan 2024 • Sahil Patel, Daniel Karapetyan
The Conditional Markov Chain Search (CMCS) is a framework for automated design of metaheuristics for discrete combinatorial optimisation problems.
no code implementations • 7 May 2021 • 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 specification constraints.
no code implementations • 15 Jan 2021 • Daniel Karapetyan, Andrew J. Parkes
The main aim of decision support systems is to find solutions that satisfy user requirements.
Discrete Mathematics
no code implementations • 19 Jul 2019 • Olegs Nalivajevs, Daniel Karapetyan
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.
no code implementations • 19 Jul 2019 • Dobromir Marinov, Daniel Karapetyan
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.
no code implementations • 26 Mar 2018 • Daniel Karapetyan, Andrew J. Parkes, Thomas Stützle
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.
no code implementations • 16 Nov 2017 • Daniel Karapetyan, Boris Goldengorin
Then the process of composition of a metaheuristic from the algorithmic components is reduced to an optimisation problem seeking the best performing CMCS configuration.
no code implementations • 6 May 2016 • Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes
We study the Bipartite Boolean Quadratic Programming Problem (BBQP) which is an extension of the well known Boolean Quadratic Programming Problem (BQP).
no code implementations • 19 Apr 2016 • Daniel Karapetyan, Andrew J. Parkes, Gregory Gutin, Andrei Gagarin
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.
no code implementations • 13 Nov 2015 • Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes
Multi-mode resource and precedence-constrained project scheduling is a well-known challenging real-world optimisation problem.