Pages that link to "Item:Q394382"

The following pages link to Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382):

Displaying 7 items.

• A linear mixed integer programming model for \(N\)-vehicle exploration problem (Q259122) (← 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)
• Modeling and solving a multi-period inventory fulfilling and routing problem for hazardous materials (Q2200132) (← links)
• A novel MILP model for \(N\)-vehicle exploration problem (Q2240108) (← links)
• A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (Q2267269) (← links)
• A kind of rollout algorithm for \(N\) vehicles exploration problem (Q2924359) (← links)