Journal of the Operations Research Society of China
Previous Articles Next Articles
Online:
Published:
Abstract:
Finding the accurate solution for N-vehicle exploration problem is NPhard 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.
Li-LiWang· Bing-Ling She · Jun-Feng Liu ·Jin-Chaun Cui. A Linear Mixed Integer Programming Model for N-Vehicle Exploration Problem[J]. Journal of the Operations Research Society of China, doi: 10.1007/s40305-015-0099-6.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jorsc.shu.edu.cn/EN/10.1007/s40305-015-0099-6
https://www.jorsc.shu.edu.cn/EN/Y2015/V3/I4/489