alinearmixedintegerprogrammingmodelfornvehicleexplorationproblem
文献类型：期刊论文
| 作者 | Wang Lili1; She Bingling1; Liu Junfeng2; Cui Jinchuan1
|
| 刊名 | journaloftheoperationsresearchsocietyofchina
 |
| 出版日期 | 2015 |
| 卷号 | 3期号:4页码:489 |
| ISSN号 | 2194-668X |
| 英文摘要 | Finding the accurate solution for N-vehicle exploration problem is NP-hard in strong sense. In this paper, authors build a linear mixed integer programming model for N-vehicle exploration problem based on its properties. The model is then proved equivalent to the original problem. Given the model, one can apply the already existed methods and algorithms for mixed integer linear programming on N-vehicle exploration problem, which helps to enrich methods for solving N-vehicle exploration problem. |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/37354]  |
| 专题 | 应用数学研究所 |
| 作者单位 | 1.中国科学院数学与系统科学研究院 2.中国科学院动物研究所 |
| 推荐引用方式 GB/T 7714 | Wang Lili,She Bingling,Liu Junfeng,et al. alinearmixedintegerprogrammingmodelfornvehicleexplorationproblem[J]. journaloftheoperationsresearchsocietyofchina,2015,3(4):489. |
| APA | Wang Lili,She Bingling,Liu Junfeng,&Cui Jinchuan.(2015).alinearmixedintegerprogrammingmodelfornvehicleexplorationproblem.journaloftheoperationsresearchsocietyofchina,3(4),489. |
| MLA | Wang Lili,et al."alinearmixedintegerprogrammingmodelfornvehicleexplorationproblem".journaloftheoperationsresearchsocietyofchina 3.4(2015):489. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。