首页 | 本学科首页   官方微博 | 高级检索  
   检索      


On the computational complexity of the patrol boat scheduling problem with complete coverage
Authors:Timothy J Surendonk  Paul A Chircop
Institution:Defence Science and Technology Group, Joint and Operations Analysis Division, Sydney, NSW, Australia
Abstract:
Keywords:computational complexity  continuous coverage problem  patrol operations  routing  scheduling
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号