Zobrazeno 1 - 10
of 732
pro vyhledávání: '"Local search (constraint satisfaction)"'
Publikováno v:
INFORMS Journal on Computing. 34:817-833
The minimum connected dominating set (MCDS) problem consists of selecting a minimum set of vertices from an undirected graph, such that each vertex not in this set is adjacent to at least one of the vertices in it, and the subgraph induced by this ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e06bb834608317d1edead3b6439cf4f5
https://doi.org/10.1287/ijoc.2021.1106
https://doi.org/10.1287/ijoc.2021.1106
Publikováno v:
Discrete Applied Mathematics, 303, 127-136. Elsevier
Discrete Applied Mathematics, 303(XX), 127-136. Elsevier
Discrete Applied Mathematics, 303(XX), 127-136. Elsevier
Given a complete graph with an even number of vertices, and with each edge colored with one of two colors (say red or blue), an equitable Hamiltonian cycle is a Hamiltonian cycle that can be decomposed into two perfect matchings such that both perfec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98c93d0aca7fb40e66f5f1a9f527b2cf
https://doi.org/10.1016/j.dam.2020.08.023
https://doi.org/10.1016/j.dam.2020.08.023
Publikováno v:
IEEE Transactions on Intelligent Transportation Systems. 22:6784-6798
The airline crew rostering problem (CRP) is significant for balancing the workload of crew and for improving the satisfaction rate of crew’s preferences, which is related to the fairness and satisfaction of crew. However, most existing work conside
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31553c7b2a4afa3cebf86170454ee91c
https://doi.org/10.1109/tits.2020.2994779
https://doi.org/10.1109/tits.2020.2994779
Autor:
Abraham O. Fapojuwo, Xavier Fernando
A new channel assignment algorithm, called the Viterbi-like algorithm (VLA), is proposed to solve the channel assignment problem in cellular radio networks. The basic idea of the proposed algorithm is step-by-step (sequential) channel assignment with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02944f3523a73191395bbf91679a33eb
https://doi.org/10.32920/21576666
https://doi.org/10.32920/21576666
Publikováno v:
Computational Intelligence. 37:1706-1744
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::502253f5c8e04f31b029e285ce262828
https://doi.org/10.1111/coin.12438
https://doi.org/10.1111/coin.12438
Autor:
Rediet Abebe, Jon Kleinberg, Zhibin Liang, T.-H. Hubert Chan, Charalampos E. Tsourakakis, David C. Parkes, Mauro Sozio
Publikováno v:
ACM Transactions on Knowledge Discovery from Data. 16:1-34
A long line of work in social psychology has studied variations in people’s susceptibility to persuasion—the extent to which they are willing to modify their opinions on a topic. This body of literature suggests an interesting perspective on theo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f16a60029617cd3c024825ac0ecf6c2c
https://doi.org/10.1145/3466617
https://doi.org/10.1145/3466617
Publikováno v:
Journal of the Chinese Institute of Engineers. 44:573-582
This paper reports a study of the flowshop scheduling problem with two machines where a set of tasks must be scheduled on a set of machines respecting the same fixed order. The objective was to des...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3fe55ab190222c720139d4409599b69a
https://doi.org/10.1080/02533839.2021.1933600
https://doi.org/10.1080/02533839.2021.1933600
Publikováno v:
Artificial Intelligence Review. 54:5347-5411
Conjunctive normal forms (CNF) of structured satisfiability problems contain logic gate patterns. So Boolean circuits (BC) by and large can be obtained from them and thus structural information that is lost in the CNF can be recovered. However, it is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16619eee5804866e10ac1350e5bf616c
https://doi.org/10.1007/s10462-021-10024-0
https://doi.org/10.1007/s10462-021-10024-0
Autor:
P. Aruna Priya, Nitish Das
Publikováno v:
Cluster Computing. 24:3101-3122
The many-to-many assignment problem (M- MAP), and the CPU/FPGA scheduling problem are two correlated issues in the field of combinatorial optimization. The framework for Kernighan Lin-driven logarithmic barrier approach (KD-LBA) is made to solve the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fb76241e2900c14b0761e70b3376f7c
https://doi.org/10.1007/s10586-021-03292-6
https://doi.org/10.1007/s10586-021-03292-6
Publikováno v:
Journal of the Operational Research Society. 73:1532-1548
In container terminals (CTs), the performance of quay cranes (QCs) is extremely impacted by their operators' productivity, which makes the QC worker assignment a relevant element in the QC scheduling. Nevertheless, in the literature, this problem was
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c80a9802ee0fd2efd1a1df6a5bcd5ed6
https://doi.org/10.1080/01605682.2021.1907241
https://doi.org/10.1080/01605682.2021.1907241