Near-optimal MIP solutions for preference based self-scheduling (Q284428)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6581567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-optimal MIP solutions for preference based self-scheduling |
scientific article; zbMATH DE number 6581567 |
Statements
Near-optimal MIP solutions for preference based self-scheduling (English)
0 references
18 May 2016
0 references
staff scheduling
0 references
rostering
0 references
mixed integer programming
0 references
local search
0 references
0 references
0 references
0 references
0 references
0.8302583694458008
0 references
0.7870787382125854
0 references
0.7765379548072815
0 references
0.7733989953994751
0 references
