An approach using SAT solvers for the RCPSP with logical constraints (Q321002)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approach using SAT solvers for the RCPSP with logical constraints |
scientific article; zbMATH DE number 6635799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approach using SAT solvers for the RCPSP with logical constraints |
scientific article; zbMATH DE number 6635799 |
Statements
An approach using SAT solvers for the RCPSP with logical constraints (English)
0 references
7 October 2016
0 references
project scheduling
0 references
RCPSP
0 references
AND/OR/BI constraints
0 references
SAT
0 references
0 references
0 references
0 references
0.8522688746452332
0 references
0.8425275683403015
0 references
0.8313381671905518
0 references
0.7897778153419495
0 references
0.7829492092132568
0 references
