A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Sumit K. Garg / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4131982 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fast diagonal completion algorithm | |||
| Property / zbMATH Keywords: fast diagonal completion algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
travelling salesman | |||
| Property / zbMATH Keywords: travelling salesman / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
2-optimal method | |||
| Property / zbMATH Keywords: 2-optimal method / rank | |||
Normal rank | |||
Revision as of 19:16, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A diagonal completion and 2-optimal procedure for the travelling salesman problem |
scientific article |
Statements
A diagonal completion and 2-optimal procedure for the travelling salesman problem (English)
0 references
1990
0 references
fast diagonal completion algorithm
0 references
travelling salesman
0 references
2-optimal method
0 references
