A novel MILP model for N-vehicle exploration problem
From MaRDI portal
Publication:2240108
Recommendations
- A linear mixed integer programming model for N-vehicle exploration problem
- Multitask n-vehicle exploration problem: complexity and algorithm
- Efficient algorithm for a kind of exploration problem with N vehicles
- A kind of -approximation algorithm for the exploration problem with N vehicles
- A kind of rollout algorithm for N vehicles exploration problem
Cites work
- A kind of -approximation algorithm for the exploration problem with N vehicles
- A kind of rollout algorithm for N vehicles exploration problem
- A linear mixed integer programming model for N-vehicle exploration problem
- A polynomial-time approximation scheme for the airplane refueling problem
- For the airplane refueling problem local precedence implies global precedence
- Multitask n-vehicle exploration problem: complexity and algorithm
- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
- The Jeep Problem
- The local-global conjecture for scheduling with non-linear cost
- The one-machine sequencing problem
Cited in
(3)
This page was built for publication: A novel MILP model for \(N\)-vehicle exploration problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2240108)
