en:mscp
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| en:mscp [2013/05/14 08:38] – moukrim | en:mscp [2013/09/21 23:28] (current) – moukrim | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Upper and Lower Bounds for the Minimum Sum Coloring Problem | + | ====== Upper and Lower Bounds for the Minimum Sum Coloring Problem ====== |
| - | ====== | + | |
| === Description === | === Description === | ||
| Line 7: | Line 6: | ||
| - | === People involved | + | === People involved === |
| - | === | + | Yu Li\\ |
| - | Yu Li | + | Corinne Lucet\\ |
| - | Corinne Lucet | + | Aziz Moukrim\\ |
| - | Aziz Moukrim | + | Kaoutar Sghiouer\\ |
| - | Kaoutar Sghiouer | + | |
| - | ===== References | + | === References === |
| - | ===== | + | [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:mscp_cor13septembre2013.pdf|Upper and Lower Bounds for the Minimum Sum Coloring Problem}}. Submitted |
| - | [3]A. Moukrim, K. Sghiouer, C. Lucet, and Y. Li. {{en:mscp_23_janvier_2013.pdf|Upper and Lower Bounds for the Minimum Sum Coloring Problem}}. Submitted, january | + | |
Page Tools
en/mscp.txt · Last modified: 2013/09/21 23:28 by moukrim
