An efficient procedure for the N-city traveling salesman problem (Q583107): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5187226 / rank | |||
Normal rank | |||
Revision as of 12:58, 20 June 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
