Abstract
A probabilistic traveling salesman problem (PTSP) is essentially a traveling salesman problem (TSP) in which the number of nodes to be visited in each problem instance is a random variable. One can define, as well, other probabilistic problems in the context of network optimization. In this paper we give an overview of some results obtained on the PTSP and on a probabilistic version of the shortest-path problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
