A set partitioning heuristic for the home health care routing and scheduling problem (Q1711476)
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: A set partitioning heuristic for the home health care routing and scheduling problem |
scientific article; zbMATH DE number 7003110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A set partitioning heuristic for the home health care routing and scheduling problem |
scientific article; zbMATH DE number 7003110 |
Statements
A set partitioning heuristic for the home health care routing and scheduling problem (English)
0 references
18 January 2019
0 references
OR in health services
0 references
routing
0 references
scheduling
0 references
set partitioning
0 references
large neighborhood search
0 references
0 references
0 references
0 references
0.8917075
0 references
0.8890775
0 references
0.88442904
0 references
0.8825664
0 references
0.88084805
0 references
0.87999076
0 references
