Published in: LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
Maria Garcia de la Banda. Beyond Optimal Solutions for Real-World Problems (Invited Talk). In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 1:1-1:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{garciadelabanda:LIPIcs.CP.2023.1, author = {Garcia de la Banda, Maria}, title = {{Beyond Optimal Solutions for Real-World Problems}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {1:1--1:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.1}, URN = {urn:nbn:de:0030-drops-190384}, doi = {10.4230/LIPIcs.CP.2023.1}, annote = {Keywords: Combinatorial optimisation systems, usability, trust, maintenance} }
Published in: LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
Carla Juvin, Emmanuel Hebrard, Laurent Houssin, and Pierre Lopez. An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{juvin_et_al:LIPIcs.CP.2023.19, author = {Juvin, Carla and Hebrard, Emmanuel and Houssin, Laurent and Lopez, Pierre}, title = {{An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.19}, URN = {urn:nbn:de:0030-drops-190568}, doi = {10.4230/LIPIcs.CP.2023.19}, annote = {Keywords: Constraint Programming, Scheduling, Preemptive Resources} }
Published in: LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
Roger Kameugne, Sévérine Fetgo Betmbe, Thierry Noulamo, and Clémentin Tayou Djamegni. Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 20:1-20:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{kameugne_et_al:LIPIcs.CP.2023.20, author = {Kameugne, Roger and Betmbe, S\'{e}v\'{e}rine Fetgo and Noulamo, Thierry and Djamegni, Cl\'{e}mentin Tayou}, title = {{Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {20:1--20:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.20}, URN = {urn:nbn:de:0030-drops-190574}, doi = {10.4230/LIPIcs.CP.2023.20}, annote = {Keywords: Horizontally Elastic Scheduling, Edge Finder Rule, Profile, TimeTable, Resource-Constrained Project Scheduling Problem} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
Christian Bessiere, Clément Carbonnel, Martin C. Cooper, and Emmanuel Hebrard. Complexity of Minimum-Size Arc-Inconsistency Explanations. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bessiere_et_al:LIPIcs.CP.2022.9, author = {Bessiere, Christian and Carbonnel, Cl\'{e}ment and Cooper, Martin C. and Hebrard, Emmanuel}, title = {{Complexity of Minimum-Size Arc-Inconsistency Explanations}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.9}, URN = {urn:nbn:de:0030-drops-166380}, doi = {10.4230/LIPIcs.CP.2022.9}, annote = {Keywords: Constraint programming, constraint propagation, minimum explanations, complexity} }
Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Valentin Antuori, Tom Portoleau, Louis Rivière, and Emmanuel Hebrard. On How Turing and Singleton Arc Consistency Broke the Enigma Code. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{antuori_et_al:LIPIcs.CP.2021.13, author = {Antuori, Valentin and Portoleau, Tom and Rivi\`{e}re, Louis and Hebrard, Emmanuel}, title = {{On How Turing and Singleton Arc Consistency Broke the Enigma Code}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.13}, URN = {urn:nbn:de:0030-drops-153040}, doi = {10.4230/LIPIcs.CP.2021.13}, annote = {Keywords: Constraint Programming, Cryptography} }
Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Valentin Antuori, Emmanuel Hebrard, Marie-José Huguet, Siham Essodaigui, and Alain Nguyen. Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{antuori_et_al:LIPIcs.CP.2021.14, author = {Antuori, Valentin and Hebrard, Emmanuel and Huguet, Marie-Jos\'{e} and Essodaigui, Siham and Nguyen, Alain}, title = {{Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {14:1--14:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.14}, URN = {urn:nbn:de:0030-drops-153052}, doi = {10.4230/LIPIcs.CP.2021.14}, annote = {Keywords: Monte-Carlo Tree Search, Travelling Salesman Problem, Scheduling} }
Feedback for Dagstuhl Publishing