Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Travelling Salesman Problem

Examining an Operational Approach to Teaching Probability
The shortest possible route that visits each city and returns to the origin.
Published in Chapter:
Probability and Strategies
Copyright: © 2021 |Pages: 31
DOI: 10.4018/978-1-7998-3871-5.ch007
When you participate in a game, but in general when you compete with one or more opponents, it is essential to define strategic behavior. Because probability often plays a central role, it is important to learn how to profitably manage the information we have. The chapter presents a multiplicity of games, more or less known. The whole allows us to take up some already known concepts and to suggest new ways of deepening them. It should be noted that the center of the analysis is on probability and we do not want to focus only on games of chance, even if they constitute a field historically very studied.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Artificial Neural Network in Operation Management Regarding Communication Issue
TSP is a NP hard problem to find the shortest path in a particular network with covering all the nodes.
Full Text Chapter Download: US $37.50 Add to Cart
MREM, Discrete Recurrent Network for Optimization
Problem of finding the shortest closed tour that visits a series of N cities. Each city must be visited exactly one time.
Full Text Chapter Download: US $37.50 Add to Cart
The Use of Soft Computing in Management
An NP-hard problem in combinatorial optimization, the task is to find the shortest possible route that visits each city exactly once and returns to the original city.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR