research
∙
05/21/2023
The airplane refueling problem is NP-complete and is solvable in polynomial time
The airplane refueling problem is a nonlinear combinatorial optimization...
share
research
∙
04/08/2023
The n-vehicle exploration problem is NP-complete
The n-vehicle exploration problem (NVEP) is a combinatorial optimization...
research
∙
10/18/2022
A polynomial-time algorithm to solve the large scale of airplane refueling problem
Airplane refueling problem (ARP) is a scheduling problem with an objecti...
research
∙
10/08/2019
