Pages that link to "Item:Q2267269"
From MaRDI portal
The following pages link to A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (Q2267269):
Displaying 3 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)
