Steiner travelling salesman problem
id:
steiner-travelling-salesman-problem-202-14613881
title:
Steiner travelling salesman problem
text:
The Steiner traveling salesman problem is an extension of the traveling salesman problem. Given a list of cities, some of which are required, and the lengths of the roads between them, the goal is to find the shortest possible walk that visits each required city and then returns to the origin city. During a walk, vertices can be visited more than once, and edges may be traversed more than once.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Steiner_travelling_salesman_problem
date created:
date modified:
2023-01-31T17:52:41Z
main entity:
{"identifier":"Q25344771","url":"https://www.wikidata.org/entity/Q25344771"}
image:
fields total:
13
integrity:
13