On the computational complexity of the patrol boat scheduling problem with complete coverage (Q6093558)
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: On the computational complexity of the patrol boat scheduling problem with complete coverage |
scientific article; zbMATH DE number 7747009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of the patrol boat scheduling problem with complete coverage |
scientific article; zbMATH DE number 7747009 |
Statements
On the computational complexity of the patrol boat scheduling problem with complete coverage (English)
0 references
9 October 2023
0 references
computational complexity
0 references
continuous coverage problem
0 references
patrol operations
0 references
routing
0 references
scheduling
0 references
0.8367303609848022
0 references
0.6554195284843445
0 references
0.650229811668396
0 references
0.6497822403907776
0 references
0.6493721008300781
0 references
