The efficient computation of aircraft range problem

DOI10.1007/S10255-019-0858-YzbMATH Open1434.68190OpenAlexW2995449582MaRDI QIDQ2300528FDOQ2300528

Authors: Fang Yu, Jin-Chuan Cui 

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

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

zbMATH Keywords

clustercomputational complexityefficient computation mechanismaircraft range problem

Mathematics Subject Classification ID

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

• Title not available (Why is that?)
• On the Computational Complexity of Algorithms
• 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
• The Jeep Problem
• Title not available (Why is that?)
• Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem
• The Range of a Fleet of Aircraft

Cited In (2)

• Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem
• Approximate solutions of range for constant altitude – constant high subsonic speed flight of transport aircraft

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)