Showing cs.CCShow all
2 papers · 1 filter
cs.CC2023
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:…
cs.CC2023
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…