A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127304550, #quickstatements; #temporary_batch_1722635374576 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s12597-019-00396-x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S12597-019-00396-X / rank | |||
Normal rank | |||
Latest revision as of 22:28, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP |
scientific article |
Statements
A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (English)
0 references
25 March 2020
0 references
traveling salesman problem
0 references
TSP
0 references
TSP algorithm
0 references
TSP heuristic
0 references
0 references
0 references
0 references
0 references
0 references
