Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving

Autor: Robert Nieuwenhuis, Albert Oliveras, Enric Rodriguez-Carbonell, Emma Rollon

Publikováno v: IEEE Access, Vol 9, Pp 142095-142104 (2021)

The aim of this paper is practical: to show that, for at least one important real-world problem, modern SAT-based technology can beat the extremely mature branch-and-cut solving methods implemented in well-known state-of-the-art commercial solvers su

Externí odkaz: https://doaj.org/article/12e8748c4a554a81bce74d0895cf6711

Certified CNF Translations for Pseudo-Boolean Solving

Autor: Gocht, Stephan, Martins, Ruben, Nordström, Jakob, Oertel, Andy

Publikováno v: Gocht, S, Martins, R, Nordström, J & Oertel, A 2022, Certified CNF Translations for Pseudo-Boolean Solving . in K S Meel & O Strichman (eds), 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022 ., 16, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 236, 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, Haifa, Israel, 02/08/2022 . https://doi.org/10.4230/LIPIcs.SAT.2022.16

The dramatic improvements in Boolean satisfiability (SAT) solving since the turn of the millennium have made it possible to leverage state-of-the-art conflict-driven clause learning (CDCL) solvers for many combinatorial problems in academia and indus

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a859a729cf7f18199a6864b5b10a143f
https://curis.ku.dk/portal/da/publications/certified-cnf-translations-for-pseudoboolean-solving(445fa175-66e7-425b-a592-48875a8aa511).html

Comparison of column generation models for channel assignment in cellular networks

Autor: Christophe Meyer, Brigitte Jaumard, T Vovor, Odile Marcotte

Publikováno v: Discrete Applied Mathematics. 112:217-240

Nous etudions differentes formulations du probleme d'affectation de canaux dans un reseau AMRF comme programme lineaire en variables binaires. Nous considerons l'objectif de minimiser la demande non satisfaite en canaux tout en satisfaisant les contr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::814bfa52375e8a675606f68a4d573a45
https://doi.org/10.1016/s0166-218x(00)00317-6

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.