On the computational complexity of the patrol boat scheduling problem with complete coverage

Our study is primarily concerned with analyzing the computational complexity of the patrol boat scheduling problem with complete coverage (PBSPCC). This combinatorial optimization problem has important implications for maritime border protection and surveillance operations. The objective of the PBSP...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Naval research logistics Jg. 67; H. 4; S. 289 - 299
Hauptverfasser:	Surendonk, Timothy J., Chircop, Paul A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken, USA John Wiley & Sons, Inc 01.06.2020 Wiley Subscription Services, Inc
Schlagworte:	Boats Combinatorial analysis Completeness Complexity computational complexity continuous coverage problem Defence craft Optimization patrol operations Polynomials routing Scheduling
ISSN:	0894-069X, 1520-6750
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!