Suchergebnisse - "continuous coverage problem"
-
1
On the computational complexity of the patrol boat scheduling problem with complete coverage
ISSN: 0894-069X, 1520-6750Veröffentlicht: Hoboken, USA John Wiley & Sons, Inc 01.06.2020Veröffentlicht in Naval research logistics (01.06.2020)“… Our study is primarily concerned with analyzing the computational complexity of the patrol boat scheduling problem with complete coverage (PBSPCC). This …”
Volltext
Journal Article