Items where Author is "Karapetyan, Daniel"

Karapetyan, Daniel and Parkes, Andrew J and Gutin, Gregory and Gagarin, Andrei (2019) Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. The Journal of Artificial Intelligence Research, 66. pp. 85-122. DOI https://doi.org/10.1613/jair.1.11339

Karapetyan, Daniel and Vernitski, Alexei (2017) Efficient adaptive implementation of the serial schedule generation scheme using preprocessing and bloom filters. In: International Conference on Learning and Intelligent Optimization: LION 2017, 2017-06-19 - 2017-06-21, Nizhny Novgorod, Russia.

Karapetyan, Daniel and Punnen, Abraham P and Parkes, Andrew J (2017) Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem. European Journal of Operational Research, 260 (2). pp. 494-506. DOI https://doi.org/10.1016/j.ejor.2017.01.001

Karapetyan, Daniel and Atkin, Jason AD and Parkes, Andrew J and Castro-Gutierrez, Juan (2017) Lessons from building an automated pre-departure sequencer for airports. Annals of Operations Research, 252 (2). pp. 435-453. DOI https://doi.org/10.1007/s10479-015-1960-z

Crampton, Jason and Gutin, Gregory and Karapetyan, Daniel and Watrigant, Rémi (2017) The bi-objective workflow satisfiability problem and workflow resiliency. Journal of Computer Security, 25 (1). pp. 83-115. DOI https://doi.org/10.3233/JCS-16849

Asta, Shahriar and Karapetyan, Daniel and Kheiri, Ahmed and Özcan, Ender and Parkes, Andrew J (2016) Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Information Sciences, 373. pp. 476-498. DOI https://doi.org/10.1016/j.ins.2016.09.010

Punnen, Abraham P and Sripratak, Piyashat and Karapetyan, Daniel (2015) The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases. Discrete Applied Mathematics, 193. pp. 1-10. DOI https://doi.org/10.1016/j.dam.2015.04.004

Punnen, Abraham P and Sripratak, Piyashat and Karapetyan, Daniel (2015) Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. Theoretical Computer Science, 565 (C). pp. 77-89. DOI https://doi.org/10.1016/j.tcs.2014.11.008

Punnen, Abraham P and Taghipour, Sara and Karapetyan, Daniel and Bhattacharyya, Bishnu (2014) The quadratic balanced optimization problem. Discrete Optimization, 12 (1). pp. 47-60. DOI https://doi.org/10.1016/j.disopt.2014.01.001

Karapetyan, Daniel and Punnen, Abraham P (2013) A reduced integer programming model for the ferry scheduling problem. Public Transport, 4 (3). pp. 151-163. DOI https://doi.org/10.1007/s12469-012-0058-0

Karapetyan, Daniel and Gutin, Gregory (2011) A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem. Evolutionary Computation, 19 (3). pp. 345-371. DOI https://doi.org/10.1162/EVCO_a_00026

Karapetyan, Daniel and Gutin, Gregory (2011) Local search heuristics for the multidimensional assignment problem. Journal of Heuristics, 17 (3). pp. 201-249. DOI https://doi.org/10.1007/s10732-010-9133-3

Karapetyan, Daniel and Gutin, Gregory (2011) Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem. European Journal of Operational Research, 208 (3). pp. 221-232. DOI https://doi.org/10.1016/j.ejor.2010.08.011

Gutin, Gregory and Karapetyan, Daniel (2010) A memetic algorithm for the generalized traveling salesman problem. Natural Computing, 9 (1). pp. 47-60. DOI https://doi.org/10.1007/s11047-009-9111-6