The efficient computation of aircraft range problem
From MaRDI portal
Publication:2300528
DOI10.1007/s10255-019-0858-yzbMath1434.68190OpenAlexW2995449582MaRDI QIDQ2300528
Publication date: 27 February 2020
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-019-0858-y
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem
- A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
- The Range of a Fleet of Aircraft
- On the Computational Complexity of Algorithms
- The Jeep Problem
This page was built for publication: The efficient computation of aircraft range problem