5 papers
The airplane refueling problem is NP-complete and is solvable in polynomial time
Jinchuan Cui, Xiaoya Li
The airplane refueling problem is a nonlinear combinatorial optimization problem, and its equivalent problem the -vehicle exploration problem is proved to be NP-complete (arXiv:…
The n-vehicle exploration problem is NP-complete
Jinchuan Cui, Xiaoya Li
The -vehicle exploration problem (NVEP) is a nonlinear unconstrained optimization problem. Given a fleet of vehicles with mid-trip refueling technique, the NVEP tries to fin…
A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
Jinchuan Cui, Xiaoya Li
Airplane refueling problem is a nonlinear unconstrained optimization problem with feasible solutions. Given a fleet of airplanes with mid-air refueling technique, the ques…
A Fast Exact Algorithm for Airplane Refueling Problem
Jianshu Li, Xiaoyin Hu, Junjie Luo +1
We consider the airplane refueling problem, where we have a fleet of airplanes that can refuel each other. Each airplane is characterized by specific fuel tank volume and fuel cons…
A variant of multitask n-vehicle exploration problem: maximizing every processor's average profit
Yangyang Xu, Jinchuan Cui
We discuss a variant of multitask n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem asks all vehicles in a grou…