Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Karapetyan
Person information
- affiliation: University of Nottingham, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i33]Sahil Patel, Daniel Karapetyan:
Exploitation Strategies in Conditional Markov Chain Search: A case study on the three-index assignment problem. CoRR abs/2402.00076 (2024)- [i32]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Bi-objective Optimization in Role Mining. CoRR abs/2403.16757 (2024) - 2023
- [j19]Daniel Karapetyan
, Gregory Z. Gutin:
Solving the Workflow Satisfiability Problem Using General Purpose Solvers. IEEE Trans. Dependable Secur. Comput. 20(6): 4474-4485 (2023) - 2022
- [j18]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem: Theory and Experiments. ACM Trans. Priv. Secur. 25(4): 28:1-28:32 (2022) - [c14]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Generalized Noise Role Mining. SACMAT 2022: 91-102 - 2021
- [c13]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem. SACMAT 2021: 83-94 - [i31]Daniel Karapetyan, Andrew J. Parkes:
Enhancing Security via Deliberate Unpredictability of Solutions in Optimisation. CoRR abs/2101.06243 (2021) - [i30]Daniel Karapetyan, Gregory Z. Gutin:
Solving the Workflow Satisfiability Problem using General Purpose Solvers. CoRR abs/2105.03273 (2021) - [i29]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem: Theory and Experiments. CoRR abs/2106.05761 (2021) - 2020
- [c12]Gregory Z. Gutin, Daniel Karapetyan:
Constraint Branching in Workflow Satisfiability Problem. SACMAT 2020: 93-103
2010 – 2019
- 2019
- [j17]Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin:
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. J. Artif. Intell. Res. 66: 85-122 (2019) - [c11]Olegs Nalivajevs, Daniel Karapetyan:
Conditional Markov Chain Search for the Generalised Travelling Salesman Problem for Warehouse Order Picking. CEEC 2019: 75-78 - [c10]Dobromir Marinov, Daniel Karapetyan:
Hyperparameter Optimisation with Early Termination of Poor Performers. CEEC 2019: 160-163 - [i28]Olegs Nalivajevs, Daniel Karapetyan:
Conditional Markov Chain Search for the Generalised Travelling Salesman Problem for Warehouse Order Picking. CoRR abs/1907.08647 (2019) - [i27]Dobromir Marinov, Daniel Karapetyan:
Hyperparameter Optimisation with Early Termination of Poor Performers. CoRR abs/1907.08651 (2019) - 2018
- [c9]Daniel Karapetyan, Andrew J. Parkes, Thomas Stützle:
Algorithm Configuration: Learning Policies for the Quick Termination of Poor Performers. LION 2018: 220-224 - [i26]Daniel Karapetyan, Andrew J. Parkes, Thomas Stützle:
Algorithm Configuration: Learning policies for the quick termination of poor performers. CoRR abs/1803.09785 (2018) - 2017
- [j16]Daniel Karapetyan, Jason A. D. Atkin, Andrew J. Parkes, Juan Castro-Gutierrez:
Lessons from building an automated pre-departure sequencer for airports. Ann. Oper. Res. 252(2): 435-453 (2017) - [j15]Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes:
Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem. Eur. J. Oper. Res. 260(2): 494-506 (2017) - [j14]Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant:
The bi-objective workflow satisfiability problem and workflow resiliency. J. Comput. Secur. 25(1): 83-115 (2017) - [c8]Daniel Karapetyan, Alexei Vernitski:
Efficient Adaptive Implementation of the Serial Schedule Generation Scheme Using Preprocessing and Bloom Filters. LION 2017: 124-138 - [i25]Daniel Karapetyan, Alexei Vernitski:
Efficient Adaptive Implementation of the Serial Schedule Generation Scheme using Preprocessing and Bloom Filters. CoRR abs/1708.07786 (2017) - [i24]Daniel Karapetyan, Boris Goldengorin:
Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances. CoRR abs/1711.06347 (2017) - 2016
- [j13]Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Inf. Sci. 373: 476-498 (2016) - [i23]Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin:
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. CoRR abs/1604.05636 (2016) - [i22]Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes:
Multi-component approach to the bipartite Boolean quadratic programming problem. CoRR abs/1605.02038 (2016) - 2015
- [j12]Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan:
The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases. Discret. Appl. Math. 193: 1-10 (2015) - [j11]Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan:
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. Theor. Comput. Sci. 565: 77-89 (2015) - [c7]Daniel Karapetyan, Andrei V. Gagarin, Gregory Z. Gutin:
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints. FAW 2015: 138-149 - [c6]Andrew J. Parkes, Ender Özcan, Daniel Karapetyan:
A Software Interface for Supporting the Application of Data Science to Optimisation. LION 2015: 306-311 - [c5]Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan:
Valued Workflow Satisfiability Problem. SACMAT 2015: 3-13 - [i21]Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan:
Valued Workflow Satisfiability Problem. CoRR abs/1501.07814 (2015) - [i20]Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem. CoRR abs/1511.04387 (2015) - [i19]Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant:
The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency. CoRR abs/1512.07019 (2015) - 2014
- [j10]Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya:
The quadratic balanced optimization problem. Discret. Optim. 12: 47-60 (2014) - [i18]Daniel Karapetyan, Andrei V. Gagarin, Gregory Z. Gutin:
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem. CoRR abs/1412.7834 (2014) - 2013
- [j9]Daniel Karapetyan, Abraham P. Punnen:
A reduced integer programming model for the ferry scheduling problem. Public Transp. 4(3): 151-163 (2013) - [c4]Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan:
Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs. FCT 2013: 271-282 - [i17]Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan:
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. CoRR abs/1303.0160 (2013) - 2012
- [j8]Daniel Karapetyan, Mohammad Reihaneh:
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem. Algorithmic Oper. Res. 7(1): 22-29 (2012) - [j7]Daniel Karapetyan, Gregory Z. Gutin:
Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. Eur. J. Oper. Res. 219(2): 234-251 (2012) - [i16]Daniel Karapetyan, Abraham P. Punnen:
A reduced integer programming model for the ferry scheduling problem. CoRR abs/1205.3757 (2012) - [i15]Mohammad Reihaneh, Daniel Karapetyan:
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem. CoRR abs/1206.1579 (2012) - [i14]Daniel Karapetyan, Krishna T. Malladi, Snezana Mitrovic-Minic, Abraham P. Punnen:
An ejection-chain heuristic for the satellite downlink scheduling problem: A case study with RADARSAT-2. CoRR abs/1206.5503 (2012) - [i13]Daniel Karapetyan:
Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms. CoRR abs/1207.1794 (2012) - [i12]Daniel Karapetyan, Abraham P. Punnen:
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem. CoRR abs/1210.3684 (2012) - [i11]Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan:
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases. CoRR abs/1212.3736 (2012) - [i10]Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya:
The quadratic balanced optimization problem. CoRR abs/1212.4211 (2012) - 2011
- [j6]Daniel Karapetyan, Gregory Z. Gutin:
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem. Evol. Comput. 19(3): 345-371 (2011) - [j5]Daniel Karapetyan, Gregory Z. Gutin:
Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem. Eur. J. Oper. Res. 208(3): 221-232 (2011) - [j4]Daniel Karapetyan, Gregory Z. Gutin:
Local search heuristics for the multidimensional assignment problem. J. Heuristics 17(3): 201-249 (2011) - 2010
- [b1]Daniil Karapetyan:
Design, evaluation and analysis of combinatorial optimization heuristic algorithms. Royal Holloway, University of London, UK, 2010 - [j3]Gregory Z. Gutin, Daniel Karapetyan:
A memetic algorithm for the generalized traveling salesman problem. Nat. Comput. 9(1): 47-60 (2010) - [i9]Daniel Karapetyan, Gregory Z. Gutin:
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem. CoRR abs/1003.4314 (2010) - [i8]Daniel Karapetyan, Gregory Z. Gutin:
Lin-Kernighan Heuristic Adaptation for the Generalized Traveling Salesman Problem. CoRR abs/1003.5330 (2010) - [i7]Daniel Karapetyan, Gregory Z. Gutin:
Local Search Algorithms for the Generalized Traveling Salesman Problem. CoRR abs/1005.5525 (2010)
2000 – 2009
- 2009
- [j2]Gregory Z. Gutin, Daniel Karapetyan:
Generalized Traveling Salesman Problem Reduction Algorithms. Algorithmic Oper. Res. 4(2): 144-154 (2009) - [j1]Gregory Z. Gutin, Daniel Karapetyan:
A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memetic Comput. 1(1): 25-34 (2009) - [c3]Gregory Z. Gutin, Daniel Karapetyan:
Local Search Heuristics for the Multidimensional Assignment Problem. Graph Theory, Computational Intelligence and Thought 2009: 100-115 - [c2]Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon:
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. IWPEC 2009: 222-233 - [c1]Gregory Z. Gutin, Daniel Karapetyan:
A Memetic Algorithm for the Multidimensional Assignment Problem. SLS 2009: 125-129 - [i6]Gregory Z. Gutin, Daniel Karapetyan:
A Memetic Algorithm for the Multidimensional Assignment Problem. CoRR abs/0906.0862 (2009) - [i5]Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon:
FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. CoRR abs/0906.1359 (2009) - [i4]Daniel Karapetyan, Gregory Z. Gutin, Boris Goldengorin:
Empirical evaluation of construction heuristics for the multidimensional assignment problem. CoRR abs/0906.2960 (2009) - 2008
- [i3]Gregory Z. Gutin, Daniel Karapetyan:
A Memetic Algorithm for the Generalized Traveling Salesman Problem. CoRR abs/0804.0722 (2008) - [i2]Gregory Z. Gutin, Daniel Karapetyan:
Generalized Traveling Salesman Problem Reduction Algorithms. CoRR abs/0804.0735 (2008) - [i1]Gregory Z. Gutin, Daniel Karapetyan:
Local Search Heuristics For The Multidimensional Assignment Problem. CoRR abs/0806.3258 (2008) - 2007
- [p1]Gregory Z. Gutin, Daniel Karapetyan, Natalio Krasnogor:
Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem. NICSO 2007: 199-210
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
