Publications

You can also access most of my publications in Google Scholar and Research Gate.

j = journal publication; p = book chapter; c = in conference proceedings; t = conference talk without proceedings; o = other talks; s = submitted.

Group by year Group by type
Journal Publications
2021
[j20]Solving the Workflow Satisfiability Problem using General Purpose Solvers (Gregory Gutin Daniel Karapetyan), 2021.
[bibtex] [arXiv] [WSP benchmark instances, instance generator, solvers in Python and experimental data]
2019
[j19]Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints (Daniel Karapetyan, Andrew J. Parkes, Gregory Gutin, Andrei Gagarin), Journal of Artificial Intelligence Research 66, 85-122, 2019.
[bibtex] [doi] [arXiv] [WSP tool sources and executable; benchmark instances and solutions]
2017
[j18]Markov Chain methods for the bipartite Boolean quadratic programming problem (Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes), European Journal of Operational Research 260, 494–506, 2017.
[bibtex] [doi] [arXiv] [Small instances (56 Kb)] [Moderate instances (11 Mb)] [Large instances (260 Mb)] [Source code and executable of the winning CMCS configuration]
[j17]The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency (Jason Crampton, Gregory Gutin, Daniel Karapetyan, Rémi Watrigant), Journal of Computer Security 25, 83–115, 2017.
[bibtex] [doi] [arXiv]
2016
[j16]Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem (Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes), Information Sciences 373, 476–498, 2016.
[bibtex] [doi] [arXiv]
2015
[j15]Satellite downlink scheduling problem: A case study (Daniel Karapetyan, Snezana Mitrovic-Minic, Krishna T. Malladi, Abraham P. Punnen), Omega 53, 115–123, 2015.
[bibtex] [doi] [arXiv]
[j14]Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms (Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan), Theoretical Computer Science 565, 77–89, 2015.
[bibtex] [doi] [arXiv]
[j13]The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Abraham P Punnen, Piyashat Sripratak, Daniel Karapetyan), Discrete Applied Mathematics 193, 1–10, 2015.
[bibtex] [doi] [arXiv]
[j12]Lessons from Building an Automated Pre-Departure Sequencer for Airports (Daniel Karapetyan, Jason Atkin, Andrew J. Parkes, Juan Castro-Gutierrez), Annals of Operations Research, 2015.
[bibtex] [doi]
2014
[j11]The quadratic balanced optimization problem (Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya), Discrete Optimization 12, 47–60, 2014.
[bibtex] [doi] [arXiv]
2013
[j10]A reduced integer programming model for the ferry scheduling problem (Daniel Karapetyan, Abraham P. Punnen), Public Transport 4, 151–163, 2013.
[bibtex] [doi] [arXiv]
2012
[j9]An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem (Mohammad Reihaneh, Daniel Karapetyan), Algorithmic Operations Research 7, 22–29, 2012.
[bibtex] [arXiv]
[j8]Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Daniel Karapetyan, Gregory Gutin), European Journal of Operational Research 219, 234–251, 2012.
[bibtex] [doi] [arXiv]
2011
[j7]A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem. (Daniel Karapetyan, Gregory Gutin), Evolutionary computation 19, 345–371, 2011.
[bibtex] [doi] [arXiv] [instance generator]
[j6]Local search heuristics for the multidimensional assignment problem (Daniel Karapetyan, Gregory Gutin), Journal of Heuristics 17, 201–249, 2011.
[bibtex] [doi] [arXiv] [additional tables]
[j5]Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Daniel Karapetyan, Gregory Gutin), European Journal of Operational Research 208, 221–232, 2011.
[bibtex] [doi] [arXiv]
2009
[j4]A memetic algorithm for the generalized traveling salesman problem (Gregory Gutin, Daniel Karapetyan), Natural Computing 9, 47–60, 2009.
[bibtex] [doi] [arXiv] [GTSP Instances Library] [source codes]
[j3]A selection of useful theoretical tools for the design and analysis of optimization heuristics (Gregory Gutin, Daniel Karapetyan), Memetic Computing 1, 25–34, 2009.
[bibtex] [doi]
[j2]Generalized traveling salesman problem reduction algorithms (Gregory Gutin, Daniel Karapetyan), Algorithmic Operations Research 4, 144–154, 2009.
[bibtex] [arXiv]
2007
[j1]Global optimisation algorithm for wave solid gyroscope resonator balancing (in Russian) (Michael Basarab, Daniel Karapetyan), Electromagnetic Waves and Electronic Systems 11, 8–15, 2007.
[bibtex]
Book Chapters
2018
[p5]Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Korkel-Ghosh instances (Daniel Karapetyan, Boris Goldengorin), chapter in Optimization Problems in Graph Theory (Boris Goldengorin, ed.), 123–147, Springer, 2018.
[bibtex] [arXiv] [Source codes and solutions]
2016
[p4]Satellite Constellation Image Acquisition Problem: A Case Study (Krishna Teja Malladi, Snezana Mitrovic Minic, Daniel Karapetyan, Abraham P. Punnen), chapter in Space Engineering: Modeling and Optimization with Case Studies (Giorgio Fasano, János D. Pintér, eds.), 177–197, Springer International Publishing, 2016.
[bibtex] [pdf] [doi]
2015
[p3]An Integer Programming Model for the Ferry Scheduling Problem (Daniel Karapetyan, Abraham P. Punnen), chapter 22 in Case Studies in Operations Research (Katta G. Murty, ed.), 517–537, Springer, 2015.
[bibtex] [doi]
[p2]The Satellite Downlink Scheduling Problem: A Case Study of RADARSAT-2 (Daniel Karapetyan, Snezana Mitrovic-Minic, Krishna T. Malladi, Abraham P. Punnen), chapter 21 in Case Studies in Operations Research (Katta G. Murty, ed.), 497–516, Springer, 2015.
[bibtex] [doi]
2008
[p1]Greedy like algorithms for the traveling salesman and multidimensional assignment problems (Gregory Gutin, Daniel Karapetyan), chapter 16 in Advances in Greedy Algorithms (Witold Bednorz, ed.), 291–304, I-Tech, 2008.
[bibtex] [pdf] [doi]
Conference Proceedings
2021
[c21]Valued Authorization Policy Existence Problem (Eduard Eiben Gregory Gutin Daniel Karapetyan Diptapriyo Majumdar Jason Crampton), In proc. of the 26th ACM Symposium on Access Control Models and Technologies, 2021.
[bibtex] [pdf] [doi] [arXiv]
2020
[c20]Constraint Branching in Workflow Satisfiability Problem (Gregory Gutin, Daniel Karapetyan), In proc. of the 25th ACM Symposium on Access Control Models and Technologies, 2020.
[bibtex] [pdf] [doi]
[c19]Enhancing Security via Deliberate Unpredictability of Solutions in Optimisation (Daniel Karapetyan, Andrew J. Parkes), In proc. of PATAT, 2020.
[bibtex] [arXiv]
2019
[c18]Hyperparameter Optimisation with Early Termination of Poor Performers (Dobromir Marinov, Daniel Karapetyan), In proc. of CEEC 2019, IEEE Xplore, 2019.
[bibtex] [arXiv]
[c17]Conditional Markov Chain Search for the Generalised Travelling Salesman Problem for Warehouse Order Picking (Olegs Nalivajevs, Daniel Karapetyan), In proc. of CEEC 2019, IEEE Xplore, 2019.
[bibtex] [arXiv]
2018
[c16]Algorithm Configuration: Learning policies for the quick termination of poor performers (Daniel Karapetyan, Andrew J. Parkes, Thomas Stützleinst), In proc. of Proceedings of LION 2018, LNCS 11353, 220–224, 2018.
[bibtex] [arXiv] [CMCS performance data for the three domains]
2017
[c15]Efficient Adaptive Implementation of the Serial Schedule Generation Scheme using Preprocessing and Bloom Filters (Daniel Karapetyan, Alexei Vernitski), In proc. of Learning and Intelligent Optimization Conference 11, LNCS 10556, 124-138, 2017.
[bibtex] [doi] [arXiv] [Source codes (17 Kb)]
2015
[c14]A Software Interface for Supporting the Application of Data Science to Optimisation (Andrew J. Parkes, Ender Özcan, Daniel Karapetyan), In proc. of Learning and Intelligent Optimization Conference (LION 9), 12–15 January 2015, Lille, France, Lecture Notes in Computer Science 8994, 306–311, Springer, 2015.
[bibtex] [pdf] [doi]
[c13]Valued workflow satisfiability problem (Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan), In proc. of ACM symposium on Access control models and technologies (SACMAT), 1–3 June, Vienna, Austria, ACM, 2015.
Best paper award.
[bibtex] [doi] [arXiv] [Source code and instance generator]
[c12]Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints (Daniel Karapetyan, Andrei Gagarin, Gregory Gutin), In proc. of 9th International Frontiers of Algorithmics Workshop, 3–5 July 2015, Guilin, Guangxi, China, Lecture Notes in Computer Science 9130, 138–149, Springer, 2015.
[bibtex] [doi] [arXiv] [Source code and instance generator]
2014
[c11]Lessons from Building an Automated Pre-Departure Sequencer for Airports (Daniel Karapetyan, Andrew J. Parkes, Jason Atkin, Juan Castro-Gutierrez), In proc. of International Conference of the Practice and Theory of Automated Timetabling (PATAT), 26–29 August 2014, York, UK, PATAT, 2014.
[bibtex] [pdf] [slides]
2013
[c10]Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem (Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes), In proc. of Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), 27–30 August 2013, Ghent, Belgium, MISTA, 2013.
The algorithm presented in this paper won the first prize in the MISTA Scheduling Challenge.
[bibtex]
[c9]Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs (Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan), In proc. of Fundamentals of Computation Theory (FCT 2013), 19–21 August 2013, Liverpool, UK, Lecture Notes in Computer Science 8070, 271–282, Springer, 2013.
[bibtex] [doi]
2009
[c8]Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs (Gregory Gutin, Daniel Karapetyan, Igor Razgon), In proc. of International Workshop on Parameterized and Exact Computation (IWPEC), 7–11 September 2009, Copenhagen, Denmark, Lecture Notes in Computer Science 5917, 222–233, Springer, 2009.
[bibtex] [pdf] [doi] [arXiv]
[c7]Empirical evaluation of construction heuristics for the multidimensional assignment problem (Daniel Karapetyan, Gregory Gutin, Boris Goldengorin), In proc. of London Algorithmics 2008: Theory and Practice, London, UK, Texts in algorithmics, 107–122, College Publications, 2009.
[bibtex]
[c6]A memetic algorithm for the multidimensional assignment problem (Gregory Gutin, Daniel Karapetyan), In proc. of Engineering Stochastic Local Search Algorithms (SLS), 3–4 September 2009, Brussels, Belgium, Lecture Notes in Computer Science 5752, 125–129, Springer, 2009.
[bibtex] [doi] [arXiv] [conference website] [slides]
2008
[c5]Memetic algorithm for the generalized asymmetric traveling salesman problem (Gregory Gutin, Daniel Karapetyan, Natalio Krasnogor), In proc. of Nature Inspired Cooperative Strategies for Optimization (NICSO 2007), 8–10 November 2007, Acireale, Italy, Studies in Computational Intelligence 129, 199–210, Springer, 2008.
[bibtex] [doi]
[c4]Local Search Heuristics for the Multidimensional Assignment Problem (Gregory Gutin, Daniel Karapetyan), In proc. of Graph Theory, Computational Intelligence and Thought, 19–25 September 2008, Haifa, Israel, Lecture Notes in Computer Science 5420, 100–115, Springer, 2008.
[bibtex] [doi]
2006
[c3]Microsoft .NET Remoting technology extension for using in high-performance computer clusters (in Russian) (Daniel Karapetyan), In proc. of Informatics and Control Systems in XXI Cent., Moscow, Russia, BMSTU, 2006.
[bibtex]
[c2]Data serialization and deserialization performance investigation on Microsoft .NET platform (in Russian) (Daniel Karapetyan), In proc. of Student and Young Scientist Conference, Moscow, Russia, BMSTU, 2006.
[bibtex]
2005
[c1]Microsoft .NET Remoting in high-performance data processing on computer clusters (in Russian) (Daniel Karapetyan, Oleg Odintsov), In proc. of Student and Young Scientist Conference, Moscow, Russia, BMSTU, 2005.
[bibtex]
Conference Talks (no proceedings)
2017
[t15]Practically efficient algorithms for the Workflow Satisfiability Problem and its optimisation version (Daniel Karapetyan), Gregory Gutin's 60th Birthday Conference, 2017.
Invited talk.
[bibtex]
2015
[t14]A Practically Efficient Fixed Parameter Tractable Algorithm for the Valued Workflow Satisfiability Problem (Daniel Karapetyan, Jason Crampton, Gregory Gutin), EURO, Glasgow, UK, 12–15 July 2015, 2015.
Invited talk.
[bibtex]
2014
[t13]Competition Winning Hybrid Heuristic for an Extension of the Resource-Constrained Project Scheduling Problem (Daniel Karapetyan, Shahriar Asta, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes), IFORS'20, 13–18 July 2014, 2014.
[bibtex] [slides]
[t12]A New Clique Problem Arising in the Satellite Scheduling (Krishna T. Malladi, Snezana Mitrovic Minic, Daniel Karapetyan, Abraham P. Punnen), GO IX, 6–10 July 2014, 2014.
[bibtex]
[t11]A Modern Meta-heuristic Approach Winning the MISTA 2013 Scheduling Challenge (Daniel Karapetyan, Shahriar Asta, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes), OR56, 9–11 September 2014, 2014.
[bibtex] [slides]
[t10]Complexity and solvable cases of the bipartite Boolean quadratic programs (Piyashat Sripratak, Abraham Punnen, Daniel Karapetyan), CORS, Ottawa, Canada, 26–28 May 2014, 2014.
[bibtex]
[t9]Fleet size planning and schedule optimization for the British Columbia Ferry Services Inc. Practice Prize Competition. (Daniel Karapetyan, Abraham Punnen), CORS 2014, 26–28 May 2014, 2014.
This paper won the second prize in the CORS Practical Prize Competition.
[bibtex]
[t8]Path Selection Problem in Network Design (Xueying Shen, Abraham Punnen, Daniel Karapetyan), CORS 2014, 26–28 May 2014, 2014.
[bibtex]
2013
[t7]Coordinating Simulations and Combinatorial Optimisations for Emergency Departments (Daniel Karapetyan, Navid Izady, Ender Özcan, Andrew J. Parkes, Dave Worthington), CORS 2013, 27–29 May 2013, 2013.
[bibtex] [conference website] [slides]
[t6]An efficient approach to ferry scheduling and fleet optimization problems (Daniel Karapetyan, Abraham Punnen), CORS 2013, 27–29 May 2013, 2013.
[bibtex] [conference website] [slides]
[t5]First Place in MISTA 2013 Scheduling Competition (Daniel Karapetyan, Shahriar Asta, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes), LANCS Initiative Advisory Board Meeting, 18 November 2013, 2013.
[bibtex]
[t4]Satellite Image Acquisition Scheduling Problem: A case study with RADARSAT Constellation (Krishna T. Malladi, Snezana Mitrovic-Minic, Daniel Karapetyan, Abraham Punnen), CORS 2013, 27–29 May 2013, 2013.
[bibtex]
2012
[t3]An algorithm for the satellite downlink scheduling problem (Daniel Karapetyan, Krishna T. Malladi, Snezana Mitrovic-Minic, Abraham Punnen), CORS 2012, 11–13 June 2012, 2012.
[bibtex] [conference website] [slides]
2009
[t2]A memetic algorithm for the multidimensional assignment problem (Daniel Karapetyan, Gregory Gutin), 20th PCC, 22–24 June 2009, 2009.
[bibtex] [conference website] [slides]
[t1]Local search heuristics for the multidimensional assignment problem (Daniel Karapetyan, Gregory Gutin), ECCO XXII, 15–17 May 2009, 2009.
[bibtex] [conference website] [slides]
Other Talks
2013
[o3]The award-winning algorithm for the Multi-Mode Resource-Constrained Multi-Project Scheduling Problem (Shahriar Asta Ahmed Kheiri Ender Özcan Daniel Karapetyan, Andrew J. Parkes), ASAP Away Days 2013, 17–18 September 2013, Nottingham, UK, 2013.
[bibtex] [slides]
[o2]An efficient approach to ferry scheduling and fleet optimization problems (Daniel Karapetyan, Abraham P. Punnen), ASAP Seminar, 28 February 2013, Nottingham, UK, 2013.
[bibtex]
2012
[o1]Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Daniel Karapetyan, Gregory Gutin), Operations Research Seminar, 9 February 2012, Vancouver, Canada, 2012.
[bibtex] [seminar website] [slides]
Submitted
2015
[s1]Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem (Daniel Karapetyan, Abraham P. Punnen), 2015.
[bibtex] [Extra tables] [Small instances (56 Kb)] [Moderate instances (11 Mb)] [Large instances (260 Mb)] [Best known solutions (52 Kb)]