Solving the Group Cumulative Scheduling Problem with CPO and ACO

Autor: Lucas Groleaz, Christine Solnon, Samba Ndojh Ndiaye

Publikováno v: 26th International Conference on Principles and Practice of Constraint Programming
26th International Conference on Principles and Practice of Constraint Programming, Sep 2020, Louvain-la-Neuve, Belgium. pp.620--636
Lecture Notes in Computer Science ISBN: 9783030584740
CP
26th International Conference on Principles and Practice of Constraint Programming, Sep 2020, Louvain-la-Neuve, Belgium. pp.620--636, ⟨10.1007/978-3-030-58475-7_36⟩

International audience; The Group Cumulative Scheduling Problem (GCSP) comes from a real application, i.e., order preparation in food industry. Each order is composed of jobs which must be scheduled on machines, and the goal is to minimize the sum of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfec7a05de14319d0e9a21e51301f15d
https://hal.archives-ouvertes.fr/hal-02899372/file/final-version.pdf

Determinants of childhood immunizations in Senegal: Adding previous shots to sociodemographic background

Autor: Elhadji Yaya Ly, Ibrahima Diop Gaye, Valérie Seror, Mouhamadou Fall, Patrick Peretti-Watel, Sébastien Cortaredona, Samba Ndojh Ndiaye

Publikováno v: Human Vaccines & Immunotherapeutics
Human Vaccines & Immunotherapeutics, 2019, pp.1-8. ⟨10.1080/21645515.2019.1649553⟩
Human Vaccines & Immunotherapeutics, Taylor & Francis, 2019, pp.1-8. ⟨10.1080/21645515.2019.1649553⟩
Hum Vaccin Immunother

Introduction. Today, in Sub-Saharan Africa, vaccine-preventable diseases still contribute heavily to high child mortality. Maintaining high coverage rates for childhood vaccines and reducing related social inequalities are public health priorities in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d35228cebcf344b087d4d1115ea7ebe
https://hal-amu.archives-ouvertes.fr/hal-02469481

Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem

Autor: Christine Solnon, Samba Ndojh Ndiaye, Maël Minot

Publikováno v: Integration of AI and OR Techniques in Constraint Programming ISBN: 9783319597751
CPAIOR

The Sum Colouring Problem is an \({\mathcal {NP}}\)-hard problem derived from the well-known graph colouring problem. It consists in finding a proper colouring which minimizes the sum of the assigned colours rather than the number of those colours. T

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e027e7ecfa7b9b13f17f94427fd7892b
https://doi.org/10.1007/978-3-319-59776-8_29

A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem

Autor: Christine Solnon, Samba Ndojh Ndiaye, Maël Minot

Publikováno v: ICTAI
27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI)
27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2015, Vierti sul Mare, Italy. pp.461-468

International audience; The maximum common subgraph problem is an NP-hard problem which is very difficult to solve with exact approaches. To speedup the solution process, we may decompose it into independent sub-problems which are solved in parallel.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2620a34772b1a73e1353412052ab267e
https://doi.org/10.1109/ictai.2015.75

CP Models for Maximum Common Subgraph Problems

Autor: Christine Solnon, Samba Ndojh Ndiaye

Publikováno v: Principles and Practice of Constraint Programming – CP 2011 ISBN: 9783642237850
CP
17th International Conference on Principles and Practice of Constraint Programming (CP)
17th International Conference on Principles and Practice of Constraint Programming (CP), Sep 2011, Perugia, Italy. pp.637-644, ⟨10.1007/978-3-642-23786-7_48⟩

International audience; The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, or a partial subgraph, obtained by removing arc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6be28172f8e5dfd872ace8941fa09af8
https://doi.org/10.1007/978-3-642-23786-7_48