The Probabilistic Multiple-Travelling-Salesmen Facility-Location Problem locates a depot and constructs the a priori tours for visiting all demand instances at n nodes. It is an NP-hard problem that ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback