| Display title | Set TSP problem |
| Default sort key | Set TSP problem |
| Page length (in bytes) | 4,711 |
| Namespace ID | 0 |
| Page ID | 21182177 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 7 |
| Counted as a content page | Yes |
| Wikidata item ID | Q4329453 |
| Central description | generalization of the traveling salesman problem (TSP), whereby it is required to find a shortest tour in a graph which visits all specified subsets of the vertices of a graph |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Altenmann (talk | contribs) |
| Date of page creation | 20:31, 20 January 2009 |
| Latest editor | OAbot (talk | contribs) |
| Date of latest edit | 06:02, 6 May 2024 |
| Total number of edits | 46 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden category (1) | This page is a member of 1 hidden category (help):
|
| Transcluded templates (13) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
