Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem
Computers & Operations Research · 2026-02 · 186 · 107308
DOI: 10.1016/j.cor.2025.107308 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-02. Verfasst von José Coelho und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 58 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Universiteit Gent, Hercules Foundation, Vlaamse regering.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Universiteit Gent
- Hercules Foundation
- Vlaamse regering
Zitieren
APA
Coelho, J., & Vanhoucke, M. (2026). Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem. Computers & Operations Research, 186, 107308. https://doi.org/10.1016/j.cor.2025.107308
Vancouver
Coelho J, Vanhoucke M. Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem. Computers & Operations Research. 2026;186:107308. doi:10.1016/j.cor.2025.107308
BibTeX
@article{Coelho2026,
author = {Coelho, José and Vanhoucke, Mario},
title = {Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem},
journal = {Computers & Operations Research},
year = {2026},
volume = {186},
pages = {107308},
doi = {10.1016/j.cor.2025.107308}
}
EUVIMED