We study approaches for finding good solutions, and lower bounds, for three difficult combinatorial optimisation problems. The supply ship travelling salesman problem is a simplification of a situation faced by a naval logistics coordinator who must direct a support vessel taske…
"1" Result
Sort By: