The following pages link to (Q3640530):
Displaying 6 items.
- A linear mixed integer programming model for \(N\)-vehicle exploration problem (Q259122) (← links)
- Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382) (← links)
- A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit (Q692666) (← links)
- Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem (Q1782048) (← links)
- A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (Q2267269) (← links)
- The efficient computation of aircraft range problem (Q2300528) (← links)
