On the computational complexity of the patrol boat scheduling problem with complete coverage (Q6093558): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An improved formulation for the maximum coverage patrol routing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A minimum cost network flow model for the maximum covering and patrol routing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
Latest revision as of 03:20, 3 August 2024
scientific article; zbMATH DE number 7747009
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
