A heuristic approach to the overnight security service problem (Q1868811)
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 heuristic approach to the overnight security service problem |
scientific article; zbMATH DE number 1901869
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic approach to the overnight security service problem |
scientific article; zbMATH DE number 1901869 |
Statements
A heuristic approach to the overnight security service problem (English)
0 references
28 April 2003
0 references
security service
0 references
capacitated clustering
0 references
routing and scheduling
0 references
0 references
0.79656583
0 references
0.79369545
0 references
0 references
0.7890413
0 references
0.7833828
0 references
0.78186715
0 references
0.78013664
0 references
0.77958184
0 references
0.7793387
0 references
