A linear mixed integer programming model for N-vehicle exploration problem
DOI10.1007/S40305-015-0099-6zbMATH Open1332.90179OpenAlexW2260480664MaRDI QIDQ259122FDOQ259122
Authors: Lili Wang, Bing-Ling She, Junfeng Liu, Jin-Chaun Cui
Publication date: 11 March 2016
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-015-0099-6
Recommendations
- A novel MILP model for \(N\)-vehicle exploration problem
- Multitask \(n\)-vehicle exploration problem: complexity and algorithm
- A kind of \(\varepsilon\)-approximation algorithm for the exploration problem with \(N\) vehicles
- Efficient algorithm for a kind of exploration problem with \(N\) vehicles
- A kind of rollout algorithm for \(N\) vehicles exploration problem
Numerical mathematical programming methods (65K05) Permutations, words, matrices (05A05) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)
Cites Work
- A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
- A kind of \(\varepsilon\)-approximation algorithm for the exploration problem with \(N\) vehicles
- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
- Efficient algorithm for a kind of exploration problem with \(N\) vehicles
- A cone constrained convex program: structure and algorithms
- Optimization methods for mixed integer weakly concave programming problems
- Title not available (Why is that?)
Cited In (5)
- Multitask \(n\)-vehicle exploration problem: complexity and algorithm
- A novel MILP model for \(N\)-vehicle exploration problem
- A kind of \(\varepsilon\)-approximation algorithm for the exploration problem with \(N\) vehicles
- Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem
- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
This page was built for publication: A linear mixed integer programming model for \(N\)-vehicle exploration problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259122)