Multitask n-vehicle exploration problem: complexity and algorithm
From MaRDI portal
Multitask \(n\)-vehicle exploration problem: complexity and algorithm
Recommendations
- Efficient algorithm for a kind of exploration problem with \(N\) vehicles
- A linear mixed integer programming model for N-vehicle exploration problem
- A kind of rollout algorithm for \(N\) vehicles exploration problem
- A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit
- A novel MILP model for \(N\)-vehicle exploration problem
Cites work
- scientific article; zbMATH DE number 5504153 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 5181725 (Why is no real title available?)
- A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
- Approximate Strong Equilibrium in Job Scheduling Games
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Efficient algorithm for a kind of exploration problem with \(N\) vehicles
- Mathematical analysis II. Transl. from the 4th Russian edition by Roger Cooke
- Strong price of anarchy
- The traveling salesman problem and its variations
Cited in
(13)- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
- The choice of algorithms for solving a multi-agent routing problem based on solving related problems
- Modeling and solving a multi-period inventory fulfilling and routing problem for hazardous materials
- Efficient algorithm for a kind of exploration problem with \(N\) vehicles
- A comparative study of task assignment and path planning methods for multi-UGV missions
- A kind of rollout algorithm for \(N\) vehicles exploration problem
- A novel MILP model for \(N\)-vehicle exploration problem
- A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit
- A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
- Heuristic reoptimization of time-extended multi-robot task allocation problems
- A linear mixed integer programming model for \(N\)-vehicle exploration problem
- Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem
- A kind of \(\varepsilon\)-approximation algorithm for the exploration problem with \(N\) vehicles
This page was built for publication: Multitask \(n\)-vehicle exploration problem: complexity and algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394382)
