Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Olfa Harrabi"'
Publikováno v:
IEEE Access, Vol 8, Pp 57891-57904 (2020)
The objective of this paper is to derive a tight and efficient lower bound for the minimum sum coloring problem. This NP-hard problem is a variant of the classical graph coloring problem where the objective is to minimize the sum of the colors. A col
Externí odkaz:
https://doaj.org/article/f76eab815869400eb0072a47fbbe8488
Autor:
Olfa Harrabi, Jouhaina Chaouachi Siala
Publikováno v:
Advances in Computational Collective Intelligence ISBN: 9783031162091
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9333a35f88ac730fc1bdc8b864d3f921
https://doi.org/10.1007/978-3-031-16210-7_51
https://doi.org/10.1007/978-3-031-16210-7_51
Autor:
Jouhaina Chaouachi, Olfa Harrabi
Publikováno v:
Learning and Analytics in Intelligent Systems ISBN: 9783030930516
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88337b8250740b87dd7e74aeedf89c5a
https://doi.org/10.1007/978-3-030-93052-3_10
https://doi.org/10.1007/978-3-030-93052-3_10
Publikováno v:
IEEE Access, Vol 8, Pp 57891-57904 (2020)
The objective of this paper is to derive a tight and efficient lower bound for the minimum sum coloring problem. This NP-hard problem is a variant of the classical graph coloring problem where the objective is to minimize the sum of the colors. A col
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55a754878db800f35a87a3c6090c2ea8
https://ieeexplore.ieee.org/document/8990124/
https://ieeexplore.ieee.org/document/8990124/
Autor:
Olfa Harrabi, Jouhaina Chaouachi
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence. 32:31-57
The paper sheds light on the sum coloring of graphs which has a wealth of pertinence to several applications in scheduling and resource allocation. Throughout this work, we investigate solving the ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d053dd93920105da75370c8bd247b325
https://doi.org/10.1080/0952813x.2019.1620869
https://doi.org/10.1080/0952813x.2019.1620869
Publikováno v:
Electronic Notes in Discrete Mathematics. 66:55-62
The minimum sum coloring of graphs is a variant of the classical graph coloring problem which is known to be NP-hard. The problem consists on minimizing the sum colorings of different graph vertices. In this paper, we propose a new bi-objective model
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f11270d47f00bd7045073f2056e26fa2
https://doi.org/10.1016/j.endm.2018.03.008
https://doi.org/10.1016/j.endm.2018.03.008
An Effective Parameter Tuning for a Bi-objective Genetic Algorithm to Solve the Sum Coloring Problem
Autor:
Jouhaina Chaouachi Siala, Olfa Harrabi
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9789811315916
SocProS (1)
SocProS (1)
To tackle several combinatorial optimization problems, genetic algorithms were frequently used as powerful evolutionary methods. However, performance of these algorithms is heavily dependent on finding appropriate parameters and operators. This pheno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94865a66b036b5aabf409298906a8df0
https://doi.org/10.1007/978-981-13-1592-3_8
https://doi.org/10.1007/978-981-13-1592-3_8
Publikováno v:
AICCSA
In this paper, we tackle the sum coloring problem which is a variant of the graph coloring problem known to be NP-hard. It is an interesting theoretical problem since it can model many applications in scheduling. Sum coloring problem consists on mini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92eed741be48d4d0f06c25c8fe14c4e4
https://doi.org/10.1109/aiccsa.2017.30
https://doi.org/10.1109/aiccsa.2017.30
Publikováno v:
GECCO (Companion)
The minimum sum coloring problem (MSCP) is an extension of the graph coloring problem (GCP) which is known to be NP-hard. Due to its theoretical and practical relevance, MSCP attracts increasing attention. In this paper, a bi-objective memetic algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1668f3cb1a7c164dab9853b1b92c941b
https://doi.org/10.1145/3067695.3082035
https://doi.org/10.1145/3067695.3082035