scientific article
From MaRDI portal
Publication:3640530
zbMath1183.90341MaRDI QIDQ3640530
Publication date: 11 November 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Multitask \(n\)-vehicle exploration problem: complexity and algorithm ⋮ A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit ⋮ A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem ⋮ Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem ⋮ The efficient computation of aircraft range problem ⋮ A linear mixed integer programming model for \(N\)-vehicle exploration problem
This page was built for publication: