An efficient procedure for the N-city traveling salesman problem (Q583107): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C09 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4131952 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
traveling salesman | |||
| Property / zbMATH Keywords: traveling salesman / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
assignment | |||
| Property / zbMATH Keywords: assignment / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
additional constraints | |||
| Property / zbMATH Keywords: additional constraints / rank | |||
Normal rank | |||
Revision as of 18:16, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient procedure for the N-city traveling salesman problem |
scientific article |
Statements
An efficient procedure for the N-city traveling salesman problem (English)
0 references
1990
0 references
traveling salesman
0 references
assignment
0 references
additional constraints
0 references
