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

Full description

Saved in:

Bibliographic Details
Published in:	Naval research logistics Vol. 67; no. 4; pp. 289 - 299
Main Authors:	Surendonk, Timothy J., Chircop, Paul A.
Format:	Journal Article
Language:	English
Published:	Hoboken, USA John Wiley & Sons, Inc 01.06.2020 Wiley Subscription Services, Inc
Subjects:	Boats Combinatorial analysis Completeness Complexity computational complexity continuous coverage problem Defence craft Optimization patrol operations Polynomials routing Scheduling
ISSN:	0894-069X, 1520-6750
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!