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

DOI10.1002/NAV.21900zbMATH Open1523.90204OpenAlexW3016606212MaRDI QIDQ6093558FDOQ6093558

Authors: Timothy J. Surendonk, Paul A. Chircop 

Publication date: 9 October 2023

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21900

Recommendations

• On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
• The coastal seaspace patrol sector design and allocation problem
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Routing and Scheduling on a Shoreline with Release Times
• Computational complexity of covering cyclic graphs

zbMATH Keywords

computational complexityschedulingroutingcontinuous coverage problempatrol operations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Reducibility among combinatorial problems
• A minimum cost network flow model for the maximum covering and patrol routing problem
• An improved formulation for the maximum coverage patrol routing problem

Cited In (2)

• Theoretical complexity of grid cover problems used in radar applications
• On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage

This page was built for publication: On the computational complexity of the patrol boat scheduling problem with complete coverage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093558)