Pyramidal tours and the traveling salesman problem (Q809904): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Time-slot assignment for TDMA-systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4193256 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3768703 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3693290 / rank | |||
Normal rank | |||
Revision as of 09:55, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pyramidal tours and the traveling salesman problem |
scientific article |
Statements
Pyramidal tours and the traveling salesman problem (English)
0 references
1991
0 references
traveling salesman
0 references
shortest Hamiltonian tour
0 references
shortest pyramidal tour
0 references
Demidenko conditions
0 references
heuristics
0 references
