A linear mixed integer programming model for N-vehicle exploration problem
From MaRDI portal
A linear mixed integer programming model for \(N\)-vehicle exploration problem
Recommendations
- A novel MILP model for \(N\)-vehicle exploration problem
- Multitask n-vehicle exploration problem: complexity and algorithm
- A kind of -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
Cites work
- A cone constrained convex program: structure and algorithms
- A kind of -approximation algorithm for the exploration problem with N vehicles
- A method of estimating computational complexity based on input conditions for N-vehicle problem
- Efficient algorithm for a kind of exploration problem with N vehicles
- scientific article; zbMATH DE number 5181725 (Why is no real title available?)
- Optimization methods for mixed integer weakly concave programming problems
- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
Cited in
(5)- Research on the efficient computation mechanism -- in the case of N-vehicle exploration problem
- A novel MILP model for \(N\)-vehicle exploration problem
- A kind of -approximation algorithm for the exploration problem with N vehicles
- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
- Multitask n-vehicle exploration problem: complexity and algorithm
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)
