THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES (Q5249292): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two Algorithmic Results for the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximizing traveling salesman problem for special matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An approximation algorithm for the maximum traveling salesman problem / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054101000886 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089999965 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:08, 30 July 2024
scientific article; zbMATH DE number 6432516
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES |
scientific article; zbMATH DE number 6432516 |
Statements
THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES (English)
0 references
30 April 2015
0 references
maximum traveling salesman problem
0 references
banded matrices
0 references
polynomial algorithm
0 references
difference equations
0 references
