The efficient computation of aircraft range problem
From MaRDI portal
Publication:2300528
Recommendations
- Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem
- The problem of maximum range flight
- Efficient algorithm for a kind of exploration problem with \(N\) vehicles
- Publication:4725744
- A method of estimating computational complexity based on input conditions for N-vehicle problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 813678 (Why is no real title available?)
- 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
- On the Computational Complexity of Algorithms
- Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem
- The Jeep Problem
- The Range of a Fleet of Aircraft
Cited in
(2)
This page was built for publication: The efficient computation of aircraft range problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300528)