Daniel Karapetyan
Daniel Karapetyan
School of Computer Science, University of Nottingham
Dirección de correo verificada de nottingham.ac.uk - Página principal
Título
Citado por
Citado por
Año
A memetic algorithm for the generalized traveling salesman problem
G Gutin, D Karapetyan
Natural Computing 9 (1), 47-60, 2010
1292010
Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem
D Karapetyan, G Gutin
European Journal of Operational Research 208 (3), 221-232, 2011
1012011
Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem
S Asta, D Karapetyan, A Kheiri, E Özcan, AJ Parkes
Information Sciences 373, 476-498, 2016
672016
Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
D Karapetyan, G Gutin
European Journal of Operational Research 219 (2), 234-251, 2012
632012
Satellite downlink scheduling problem: A case study
D Karapetyan, SM Minic, KT Malladi, AP Punnen
Omega 53, 115-123, 2015
58*2015
Valued workflow satisfiability problem
J Crampton, G Gutin, D Karapetyan
Proceedings of the 20th ACM Symposium on Access Control Models and …, 2015
312015
Memetic algorithm for the generalized asymmetric traveling salesman problem
G Gutin, D Karapetyan, N Krasnogor
Nature Inspired Cooperative Strategies for Optimization (NICSO 2007), 199-210, 2008
302008
Local search heuristics for the multidimensional assignment problem
D Karapetyan, G Gutin
Journal of Heuristics 17 (3), 201-249, 2011
252011
A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem
D Karapetyan, G Gutin
Evolutionary computation 19 (3), 345-371, 2011
232011
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
A Punnen, P Sripratak, D Karapetyan
212012
A selection of useful theoretical tools for the design and analysis of optimization heuristics
G Gutin, D Karapetyan
Memetic Computing 1 (1), 25, 2009
212009
Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints
D Karapetyan, A Gagarin, G Gutin
International Workshop on Frontiers in Algorithmics, 138-149, 2015
202015
Generalized traveling salesman problem reduction algorithms
G Gutin, D Karapetyan
Algorithmic Operations Research 4, 144-154, 2009
202009
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem
M Reihaneh, D Karapetyan
Algorithmic Operations Research 7, 21-28, 2012
192012
Empirical evaluation of construction heuristics for the multidimensional assignment problem
D Karapetyan, G Gutin, B Goldengorin
London Algorithmics 2008: Theory and Practice 11, 107-122, 2009
182009
The bi-objective workflow satisfiability problem and workflow resiliency
J Crampton, G Gutin, D Karapetyan, R Watrigant
Journal of Computer Security 25 (1), 83-115, 2017
172017
Local search heuristics for the multidimensional assignment problem
G Gutin, D Karapetyan
Graph Theory, Computational Intelligence and Thought, 100-115, 2009
172009
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms
AP Punnen, P Sripratak, D Karapetyan
Theoretical Computer Science, 2014
162014
Markov chain methods for the bipartite boolean quadratic programming problem
D Karapetyan, AP Punnen, AJ Parkes
European Journal of Operational Research 260 (2), 494-506, 2017
152017
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem
D Karapetyan, AP Punnen
arXiv preprint arXiv:1210.3684, 2012
132012
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20