Polynomially solvable personnel rostering problems (Q320874)
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: Polynomially solvable personnel rostering problems |
scientific article; zbMATH DE number 6635753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomially solvable personnel rostering problems |
scientific article; zbMATH DE number 6635753 |
Statements
Polynomially solvable personnel rostering problems (English)
0 references
7 October 2016
0 references
personnel rostering
0 references
polynomial time algorithms
0 references
assignment
0 references
networks
0 references
0.8396912813186646
0 references
0.7942275404930115
0 references
0.7880188822746277
0 references
0.7866271734237671
0 references
0.7795680165290833
0 references
