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...

Celý popis

Podrobná bibliografia

Vydané v:	Naval research logistics Ročník 67; číslo 4; s. 289 - 299
Hlavní autori:	Surendonk, Timothy J., Chircop, Paul A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken, USA John Wiley & Sons, Inc 01.06.2020 Wiley Subscription Services, Inc
Predmet:	Boats Combinatorial analysis Completeness Complexity computational complexity continuous coverage problem Defence craft Optimization patrol operations Polynomials routing Scheduling
ISSN:	0894-069X, 1520-6750
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!