This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
en:mscp [2013/09/21 23:25] – moukrim | en:mscp [2013/09/21 23:28] (current) – moukrim | ||
---|---|---|---|
Line 16: | Line 16: | ||
[1] Y. Li, C. Lucet, A. Moukrim, and K. Sghiouer. Greedy algorithms for the minimum sum coloring problem. In International Workshop: Logistics and transport, 2009.\\ | [1] Y. Li, C. Lucet, A. Moukrim, and K. Sghiouer. Greedy algorithms for the minimum sum coloring problem. In International Workshop: Logistics and transport, 2009.\\ | ||
[2] A. Moukrim, K. Sghiouer, C. Lucet, and Y. Li. Lower bounds for the minimum sum coloring problem. Electronic Notes in Discrete Mathematics, | [2] A. Moukrim, K. Sghiouer, C. Lucet, and Y. Li. Lower bounds for the minimum sum coloring problem. Electronic Notes in Discrete Mathematics, | ||
- | [3] A. Moukrim, K. Sghiouer, C. Lucet, and Y. Li. {{en: | + | [3] A. Moukrim, K. Sghiouer, C. Lucet, and Y. Li. {{en: |