alinearmixedintegerprogrammingmodelfornvehicleexplorationproblem

CSpace > 应用数学研究所

	alinearmixedintegerprogrammingmodelfornvehicleexplorationproblem
	Wang Lili 1; She Bingling 1; Liu Junfeng 2; Cui Jinchuan1
	2015
发表期刊	journaloftheoperationsresearchsocietyofchina
ISSN	2194-668X
卷号	3 期号:4 页码:489
摘要	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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/37355
专题	应用数学研究所
作者单位	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.