A Linear Mixed Integer Programming Model for N -Vehicle Exploration Problem

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.