Open Access
| Issue |
RAIRO-Oper. Res.
Volume 59, Number 6, November-December 2025
|
|
|---|---|---|
| Page(s) | 3683 - 3702 | |
| DOI | https://doi.org/10.1051/ro/2025142 | |
| Published online | 10 December 2025 | |
- A. Bar-Noy and G. Kortsarz, Minimum color sum of bipartite graphs. J. Algorithms 28 (1998) 339–365. [Google Scholar]
- A. Bar-Noy, M. Bellare, M.M. Halldórsson, H. Shachnai and T. Tamir, On chromatic sums and distributed resource allocation. Inf. Comput. 140 (1998) 183–202. [Google Scholar]
- U. Benlic and J.K. Hao, A study of breakout local search for the minimum sum coloring problem, in Asia-Pacific Conference on Simulated Evolution and Learning. Springer (2012) 128–137. [Google Scholar]
- F. Bonomo, G. Durán, J. Marenco and M. Valencia-Pabon, Minimum sum set coloring of trees and line graphs of trees. Discrete Appl. Math. 159 (2011) 288–294. [Google Scholar]
- H. Bouziri and O. Harrabi, Behavior study of genetic operators for the minimum sum coloring problem, in 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO). IEEE (2013) 1–6. [Google Scholar]
- H. Bouziri and M. Jouini, A tabu search approach for the sum coloring problem. Electron. Notes Discrete Math. 36 (2010) 915–922. [Google Scholar]
- D. Brélaz, New methods to color the vertices of a graph. Commun. ACM 22 (1979) 251–256. [CrossRef] [Google Scholar]
- P. Galinier and J.K. Hao, Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim. 3 (1999) 379–397. [Google Scholar]
- P. Galinier and A. Hertz, A survey of local search methods for graph coloring. Comput. Oper. Res. 33 (2006) 2547–2562. [Google Scholar]
- F. Glover, Tabu search and adaptive memory programming – advances, applications and challenges, in Interfaces in Computer Science and Operations Research. Springer (1997) 1–75. [Google Scholar]
- O. Harrabi and J.C. Siala, An effective parameter tuning for a bi-objective genetic algorithm to solve the sum coloring problem, in Soft Computing for Problem Solving. Springer (2019) 107–119. [Google Scholar]
- A. Helmar and M. Chiarandini, A local search heuristic for chromatic sum, in Proceedings of the 9th Metaheuristics International Conference. Vol. 1101 (2011) 161–170. [Google Scholar]
- Y. Jin and J.K. Hao, Hybrid evolutionary search for the minimum sum coloring problem of graphs. Inf. Sci. 352 (2016) 15–34. [Google Scholar]
- Y. Jin, J.K. Hao and J.P. Hamiez, A memetic algorithm for the minimum sum coloring problem. Comput. Oper. Res. 43 (2014) 318–327. [Google Scholar]
- Y. Jin, J.P. Hamiez and J.K. Hao, Algorithms for the minimum sum coloring problem: a review. Artif. Intell. Rev. 47 (2017) 367–394. [Google Scholar]
- Z. Kokosiński and K. Kwarciany, On sum coloring of graphs with parallel genetic algorithms, in International Conference on Adaptive and Natural Computing Algorithms. Springer (2007) 211–219. [Google Scholar]
- L.G. Kroon, A. Sen, H. Deng and A. Roy, The optimal cost chromatic partition problem for trees and interval graphs, in International Workshop on Graph-Theoretic Concepts in Computer Science. Springer (1996) 279–292. [Google Scholar]
- E. Kubicka and A.J. Schwenk, An introduction to chromatic sums, in Proceedings of the 17th conference on ACM Annual Computer Science Conference. ACM (1989) 39–45. [Google Scholar]
- E. Kubicka, G. Kubicki and D. Kountanis, Approximation algorithms for the chromatic sum, in Computing in the 90’s. Springer (1991) 15–21. [Google Scholar]
- Y. Li, C. Lucet, A. Moukrim and K. Sghiouer, Greedy algorithms for the minimum sum coloring problem, in Logistique et transports (2009) LT–027. [Google Scholar]
- A. Liefooghe, L. Jourdan and E.G. Talbi, A unified model for evolutionary multi-objective optimization and its implementation in a general purpose software framework, in IEEE Symposium on Computational Intelligence in Miulti-Criteria Decision-Making, 2009. MCDM’09. IEEE (2009) 88–95. [Google Scholar]
- Z. Lü and J.K. Hao, A memetic algorithm for graph coloring. Eur. J. Oper. Res. 203 (2010) 241–250. [Google Scholar]
- A. Moukrim, K. Sghiouer, C. Lucet and Y. Li, Lower bounds for the minimal sum coloring problem. Electron. Notes Discrete Math. 36 (2010) 663–670. [Google Scholar]
- A. Moukrim, K. Sghiouer, C. Lucet and Y. Li, Upper and lower bounds for the minimum sum coloring problem (2014). [Google Scholar]
- D.C. Porumbel, J.K. Hao and P. Kuntz, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. Comput. Oper. Res. 37 (2010) 1822–1832. [Google Scholar]
- M.R. Salavatipour, On sum coloring of graphs. Discrete Appl. Math. 127 (2003) 477–488. [Google Scholar]
- J.D. Schaffer, Multiple objective optimization with vector evaluated genetic algorithms, in Proceedings of the First International Conference on Genetic Algorithms and Their Applications, 1985. Lawrence Erlbaum Associates. Inc., Publishers (1985). [Google Scholar]
- A. Sen, H. Deng and S. Guha, On a graph partition problem with application to VLSI layout. Inf. Process. Lett. 43 (1992) 87–94. [Google Scholar]
- Q. Wu and J.K. Hao, An effective heuristic algorithm for sum coloring of graphs. Comput. Oper. Res. 39 (2012) 1593–1600. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.