An efficient procedure for the N-city traveling salesman problem (Q583107): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0895-7177(90)90376-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061775329 / rank | |||
Normal rank | |||
Latest revision as of 10:41, 30 July 2024
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
