On Gilmore-Gomory's open question for the bottleneck TSP. (Q1412716): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5187226 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3525911 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simple algorithms for gilmore-gomory's traveling salesman and related problems / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:55, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Gilmore-Gomory's open question for the bottleneck TSP. |
scientific article |
Statements
On Gilmore-Gomory's open question for the bottleneck TSP. (English)
0 references
25 November 2003
0 references
0 references
