The home care crew scheduling problem: preference-based visit clustering and temporal dependencies (Q1926679)
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: The home care crew scheduling problem: preference-based visit clustering and temporal dependencies |
scientific article; zbMATH DE number 6119314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The home care crew scheduling problem: preference-based visit clustering and temporal dependencies |
scientific article; zbMATH DE number 6119314 |
Statements
The home care crew scheduling problem: preference-based visit clustering and temporal dependencies (English)
0 references
29 December 2012
0 references
home care
0 references
crew scheduling
0 references
vehicle routing
0 references
generalised precedence constraints
0 references
branch-and-price
0 references
set partitioning
0 references
0 references
0 references
0 references
0 references
0.7871429324150085
0 references
0.7584359645843506
0 references
0.7540515065193176
0 references
0.7525016665458679
0 references
0.749869167804718
0 references
