Local search and lower bounds for the patient admission scheduling problem (Q632698)
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: Local search and lower bounds for the patient admission scheduling problem |
scientific article; zbMATH DE number 5870597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local search and lower bounds for the patient admission scheduling problem |
scientific article; zbMATH DE number 5870597 |
Statements
Local search and lower bounds for the patient admission scheduling problem (English)
0 references
25 March 2011
0 references
local search
0 references
simulated annealing
0 references
lower bounds
0 references
healthcare
0 references
0 references
0 references
0 references
0 references
0.7885726690292358
0 references
0.7829402089118958
0 references
0.7529316544532776
0 references
0.7490290403366089
0 references
0.7217913866043091
0 references
