COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING (Q4889753)
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: COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING |
scientific article; zbMATH DE number 913796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING |
scientific article; zbMATH DE number 913796 |
Statements
COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING (English)
0 references
25 November 1996
0 references
manpower scheduling
0 references
change shift assignment problem
0 references
fixed-charge network
0 references
minimum-cost flow
0 references
0.8660593032836914
0 references
0.8003636002540588
0 references
0.7789751291275024
0 references
