首页> 美国政府科技报告 >An Approximation Algorithm for an Optimum AIM Points Problem
【24h】

An Approximation Algorithm for an Optimum AIM Points Problem

机译:一种最优aIm点问题的近似算法

获取原文

摘要

An algorithm to solve the particular problem of assigning weapons over a target complex in an effective manner is considered. The case of where to attach a city-target complex with six missiles of 1/2-MT yield which are delivered according to a circular normal distribution is examined.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号