On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage-Reference-Cited by-同舟云学术

On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage

Published:2022-01-20 Issue:2 Volume:312 Page:723-760
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Chircop Paul A.^ORCID,Surendonk Timothy J.^ORCID,van den Briel Menkes H. L.,Walsh Toby^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

https://link.springer.com/content/pdf/10.1007/s10479-021-04474-6.pdf

Reference50 articles.

1. Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows: Theory, algorithms, and applications. Prentice Hall.

2. Akca, Z., Ralphs, T. K., & Berger, R. T. (2010). Solution methods for the multi-trip elementary shortest path problem with resource constraints. Optimization Online. http://www.optimization-online.org/DB_HTML/2011/03/2962.html.

3. Andersen, J., Christiansen, M., Crainic, T. G., & Grønhaug, R. (2011). Branch and price for service network design with asset management constraints. Transportation Science, 45(1), 33–49.

4. Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Va, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3), 316–329.

5. Ben Amor, H., & Valério de Carvalho, J. (2005). Cutting stock problems. In G. Desaulniers, J. Desrosiers, & M. M. Solomon (Eds.), Column generation (pp. 131–161). Springer.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Robust Security Guard Scheduling Problem in Dynamic Environment;Transactions of the Japanese Society for Artificial Intelligence;2024-09-01

2. The Hot Spot Coverage Patrol Problem: Formulations and Solution Approaches;INFORMS Journal on Computing;2023-11